5-Coloring Graphs with 4 Crossings
Work
Year: 2011
Type: article
Abstract: We answer in the negative a question of Oporowski and Zhao [Discrete Math., 309 (2009), pp. 2948–2951] asking whether every graph with crossing number at most 5 and clique number at most 5 is 5-colora... more
Cites: 18
Cited by: 7
Related to: 10
FWCI: 0.83
Citation percentile (by year/subfield): 62.35
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green