Iterated colorings of graphs.
From MaRDI portal
Publication:1427472
DOI10.1016/S0012-365X(03)00247-4zbMath1038.05022OpenAlexW2088561458MaRDI QIDQ1427472
Stephen T. Hedetniemi, Jan Arne Telle, Sandra M. Hedetniemi, Alice A. McRae, Dee Parks
Publication date: 14 March 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00247-4
Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Transitivity on subclasses of chordal graphs ⋮ My Top 10 Graph Theory Conjectures and Open Problems ⋮ Transitivity on subclasses of bipartite graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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