Crossing Numbers and Cutwidths
Gespeichert in:
| Veröffentlicht in: | Journal of graph algorithms and applications 2003, Vol.7 (3), p.245-251 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 251 |
|---|---|
| container_issue | 3 |
| container_start_page | 245 |
| container_title | Journal of graph algorithms and applications |
| container_volume | 7 |
| creator | Djidjev, Hristo N. Vrťo, Imrich |
| description | |
| doi_str_mv | 10.7155/jgaa.00069 |
| format | Article |
| fullrecord | <record><control><sourceid>crossref</sourceid><recordid>TN_cdi_crossref_primary_10_7155_jgaa_00069</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>10_7155_jgaa_00069</sourcerecordid><originalsourceid>FETCH-LOGICAL-c1809-149f5dacadde2e946eb635b96c6c910d00f4ea26526757021f96234cb5afec873</originalsourceid><addsrcrecordid>eNpNj0tPAjEURhuDiYBu_AFm1iQD97bTdrokE0QTghtdN3f6wCHySAsx_nsddOHqO6sv5zB2jzDVKOVsuyGaAoAyV2yIkqsSNZrBP75ho5y3AFxwXQ_ZQ5MOOXf7TbE-79qQckF7XzTn02fnT-_5ll1H-sjh7m_H7O1x8do8lauX5XMzX5UOazAlViZKT468DzyYSoVWCdka5ZQzCB4gVoG4-pHQUgPHaBQXlWslxeBqLcZs8vvrep0Uoj2mbkfpyyLYvsz2ZfZSJr4BIDNAKw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Crossing Numbers and Cutwidths</title><source>DOAJ Directory of Open Access Journals</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>Djidjev, Hristo N. ; Vrťo, Imrich</creator><creatorcontrib>Djidjev, Hristo N. ; Vrťo, Imrich</creatorcontrib><identifier>ISSN: 1526-1719</identifier><identifier>EISSN: 1526-1719</identifier><identifier>DOI: 10.7155/jgaa.00069</identifier><language>eng</language><ispartof>Journal of graph algorithms and applications, 2003, Vol.7 (3), p.245-251</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c1809-149f5dacadde2e946eb635b96c6c910d00f4ea26526757021f96234cb5afec873</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,864,4024,27923,27924,27925</link.rule.ids></links><search><creatorcontrib>Djidjev, Hristo N.</creatorcontrib><creatorcontrib>Vrťo, Imrich</creatorcontrib><title>Crossing Numbers and Cutwidths</title><title>Journal of graph algorithms and applications</title><issn>1526-1719</issn><issn>1526-1719</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2003</creationdate><recordtype>article</recordtype><recordid>eNpNj0tPAjEURhuDiYBu_AFm1iQD97bTdrokE0QTghtdN3f6wCHySAsx_nsddOHqO6sv5zB2jzDVKOVsuyGaAoAyV2yIkqsSNZrBP75ho5y3AFxwXQ_ZQ5MOOXf7TbE-79qQckF7XzTn02fnT-_5ll1H-sjh7m_H7O1x8do8lauX5XMzX5UOazAlViZKT468DzyYSoVWCdka5ZQzCB4gVoG4-pHQUgPHaBQXlWslxeBqLcZs8vvrep0Uoj2mbkfpyyLYvsz2ZfZSJr4BIDNAKw</recordid><startdate>2003</startdate><enddate>2003</enddate><creator>Djidjev, Hristo N.</creator><creator>Vrťo, Imrich</creator><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>2003</creationdate><title>Crossing Numbers and Cutwidths</title><author>Djidjev, Hristo N. ; Vrťo, Imrich</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c1809-149f5dacadde2e946eb635b96c6c910d00f4ea26526757021f96234cb5afec873</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2003</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Djidjev, Hristo N.</creatorcontrib><creatorcontrib>Vrťo, Imrich</creatorcontrib><collection>CrossRef</collection><jtitle>Journal of graph algorithms and applications</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Djidjev, Hristo N.</au><au>Vrťo, Imrich</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Crossing Numbers and Cutwidths</atitle><jtitle>Journal of graph algorithms and applications</jtitle><date>2003</date><risdate>2003</risdate><volume>7</volume><issue>3</issue><spage>245</spage><epage>251</epage><pages>245-251</pages><issn>1526-1719</issn><eissn>1526-1719</eissn><doi>10.7155/jgaa.00069</doi><tpages>7</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1526-1719 |
| ispartof | Journal of graph algorithms and applications, 2003, Vol.7 (3), p.245-251 |
| issn | 1526-1719 1526-1719 |
| language | eng |
| recordid | cdi_crossref_primary_10_7155_jgaa_00069 |
| source | DOAJ Directory of Open Access Journals; EZB-FREE-00999 freely available EZB journals |
| title | Crossing Numbers and Cutwidths |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T23%3A53%3A21IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Crossing%20Numbers%20and%20Cutwidths&rft.jtitle=Journal%20of%20graph%20algorithms%20and%20applications&rft.au=Djidjev,%20Hristo%20N.&rft.date=2003&rft.volume=7&rft.issue=3&rft.spage=245&rft.epage=251&rft.pages=245-251&rft.issn=1526-1719&rft.eissn=1526-1719&rft_id=info:doi/10.7155/jgaa.00069&rft_dat=%3Ccrossref%3E10_7155_jgaa_00069%3C/crossref%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |