5-Coloring Graphs with 4 Crossings
Abstract
Keywords
Get full access to this article
View all available purchase options and get full access to this article.
References
Information & Authors
Information
Published In

Copyright
History
Keywords
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- The Complexity of Chromatic Number When Restricted to graphs with Bounded Genus or Bounded Crossing NumberACM SIGACT News, Vol. 53, No. 2 | 27 July 2022
- IC-Planar Graphs Are 6-ChoosableSIAM Journal on Discrete Mathematics, Vol. 35, No. 3 | 5 August 2021
- Graphs with Two Crossings Are 5-ChoosableSIAM Journal on Discrete Mathematics, Vol. 25, No. 4 | 8 December 2011
View Options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].