Linear coloring of graphs embeddable in a surface of nonnegative characteristic
From MaRDI portal
Publication:1041551
DOI10.1007/s11425-008-0143-7zbMath1184.05052OpenAlexW1987761026MaRDI QIDQ1041551
Publication date: 2 December 2009
Published in: Science in China. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11425-008-0143-7
Related Items
Linear coloring of planar graphs without 4-cycles, On linear coloring of planar graphs with small girth, Linear coloring of sparse graphs, Improved bounds on linear coloring of plane graphs, Upper bounds on the linear chromatic number of a graph, A result on linear coloring of planar graphs, New upper bounds on linear coloring of planar graphs, The linear \(t\)-colorings of Sierpiński-like graphs, \(k\)-forested choosability of planar graphs and sparse graphs
Cites Work