The entire coloring of series-parallel graphs

DOI10.1007/s10255-005-0215-1zbMath1091.05029OpenAlexW2072994899MaRDI QIDQ2577645

Yu-Liang Wu, Jian Liang Wu

Publication date: 5 January 2006

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10255-005-0215-1

zbMATH Keywords

entire chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

The entire choosability of plane graphs ⋮ Acyclic edge coloring of graphs with large girths ⋮ On \(r\)-acyclic edge colorings of planar graphs ⋮ Entire choosability of near-outerplane graphs ⋮ Acyclic edge colorings of planar graphs and series parallel graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Planar graphs: Theory and algorithms
• Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces
• The linear arboricity of series-parallel graphs
• On the colorings of outerplanar graphs
• Topology of series-parallel networks
• A seven-color theorem on the sphere
• Colouring series-parallel graphs
• On the Entire Coloring Conjecture
• Structural theorem on plane graphs with application to the entire coloring number
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs

This page was built for publication: The entire coloring of series-parallel graphs