The thickness of fan-planar graphs is at most three
We prove that in any strongly fan-planar drawing of a graph G the edges can be colored with at most three colors, such that no two edges of the same color cross. This implies that the thickness of strongly fan-planar graphs is at most three. If G is bipartite, then two colors suffice to color the ed...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Cheong, Otfried Pfister, Maximilian Schlipf, Lena |
| description | We prove that in any strongly fan-planar drawing of a graph G the edges can
be colored with at most three colors, such that no two edges of the same color
cross. This implies that the thickness of strongly fan-planar graphs is at most
three. If G is bipartite, then two colors suffice to color the edges in this
way. |
| doi_str_mv | 10.48550/arxiv.2208.12324 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_2208_12324</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2208_12324</sourcerecordid><originalsourceid>FETCH-LOGICAL-a674-42e094e972f070f05eafb2437e5fb1462d65a2af875eca63389a8a560ff112703</originalsourceid><addsrcrecordid>eNotzrtOw0AQheFtKFDgAaiyL2BndvbqEkXhIkWicW9NkpnYInGsXQvB2wOB6jS_jj6lHgzULnkPK8qfw0eNCKk2aNHdKtv2rOd-2L-PXIq-iBYaq-lEI2V9zDT1RQ9F06zPlzL_lJn5Tt0InQrf_-9CtU-bdv1Sbd-eX9eP24pCdJVDhsZxE1EggoBnkh06G9nLzriAh-AJSVL0vKdgbWookQ8gYgxGsAu1_Lu9qrspD2fKX92vvrvq7TejIT3-</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>The thickness of fan-planar graphs is at most three</title><source>arXiv.org</source><creator>Cheong, Otfried ; Pfister, Maximilian ; Schlipf, Lena</creator><creatorcontrib>Cheong, Otfried ; Pfister, Maximilian ; Schlipf, Lena</creatorcontrib><description>We prove that in any strongly fan-planar drawing of a graph G the edges can
be colored with at most three colors, such that no two edges of the same color
cross. This implies that the thickness of strongly fan-planar graphs is at most
three. If G is bipartite, then two colors suffice to color the edges in this
way.</description><identifier>DOI: 10.48550/arxiv.2208.12324</identifier><language>eng</language><subject>Computer Science - Computational Geometry ; Mathematics - Combinatorics</subject><creationdate>2022-08</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/2208.12324$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.2208.12324$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Cheong, Otfried</creatorcontrib><creatorcontrib>Pfister, Maximilian</creatorcontrib><creatorcontrib>Schlipf, Lena</creatorcontrib><title>The thickness of fan-planar graphs is at most three</title><description>We prove that in any strongly fan-planar drawing of a graph G the edges can
be colored with at most three colors, such that no two edges of the same color
cross. This implies that the thickness of strongly fan-planar graphs is at most
three. If G is bipartite, then two colors suffice to color the edges in this
way.</description><subject>Computer Science - Computational Geometry</subject><subject>Mathematics - Combinatorics</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2022</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzrtOw0AQheFtKFDgAaiyL2BndvbqEkXhIkWicW9NkpnYInGsXQvB2wOB6jS_jj6lHgzULnkPK8qfw0eNCKk2aNHdKtv2rOd-2L-PXIq-iBYaq-lEI2V9zDT1RQ9F06zPlzL_lJn5Tt0InQrf_-9CtU-bdv1Sbd-eX9eP24pCdJVDhsZxE1EggoBnkh06G9nLzriAh-AJSVL0vKdgbWookQ8gYgxGsAu1_Lu9qrspD2fKX92vvrvq7TejIT3-</recordid><startdate>20220825</startdate><enddate>20220825</enddate><creator>Cheong, Otfried</creator><creator>Pfister, Maximilian</creator><creator>Schlipf, Lena</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20220825</creationdate><title>The thickness of fan-planar graphs is at most three</title><author>Cheong, Otfried ; Pfister, Maximilian ; Schlipf, Lena</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a674-42e094e972f070f05eafb2437e5fb1462d65a2af875eca63389a8a560ff112703</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2022</creationdate><topic>Computer Science - Computational Geometry</topic><topic>Mathematics - Combinatorics</topic><toplevel>online_resources</toplevel><creatorcontrib>Cheong, Otfried</creatorcontrib><creatorcontrib>Pfister, Maximilian</creatorcontrib><creatorcontrib>Schlipf, Lena</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Cheong, Otfried</au><au>Pfister, Maximilian</au><au>Schlipf, Lena</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The thickness of fan-planar graphs is at most three</atitle><date>2022-08-25</date><risdate>2022</risdate><abstract>We prove that in any strongly fan-planar drawing of a graph G the edges can
be colored with at most three colors, such that no two edges of the same color
cross. This implies that the thickness of strongly fan-planar graphs is at most
three. If G is bipartite, then two colors suffice to color the edges in this
way.</abstract><doi>10.48550/arxiv.2208.12324</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.2208.12324 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_2208_12324 |
| source | arXiv.org |
| subjects | Computer Science - Computational Geometry Mathematics - Combinatorics |
| title | The thickness of fan-planar graphs is at most three |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-14T17%3A17%3A00IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20thickness%20of%20fan-planar%20graphs%20is%20at%20most%20three&rft.au=Cheong,%20Otfried&rft.date=2022-08-25&rft_id=info:doi/10.48550/arxiv.2208.12324&rft_dat=%3Carxiv_GOX%3E2208_12324%3C/arxiv_GOX%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 |