Iterated colorings of graphs.
From MaRDI portal
Publication:1427472
DOI10.1016/S0012-365X(03)00247-4zbMath1038.05022MaRDI QIDQ1427472
Sandra M. Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Jan Arne Telle, Dee Parks
Publication date: 14 March 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
68R10: Graph theory (including graph drawing) in computer science
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
Cites Work
- Some perfect coloring properties of graphs
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Properties of Hereditary Hypergraphs and Middle Graphs
- Algorithms for Vertex Partitioning Problems on Partial k-Trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item