Connected sequential colourings

DOI10.1016/0012-365X(89)90197-0zbMath0677.05029OpenAlexW2053570779MaRDI QIDQ1123198

Alain Hertz, Dominique de Werra

Publication date: 1989

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(89)90197-0

zbMATH Keywords

canonical colouringparity graphconnected order

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

Hard-to-color graphs for connected sequential colorings, The connected greedy coloring game, Connected greedy coloring of \(H\)-free graphs, Coloring Meyniel graphs in linear time

Cites Work

• A note on strong perfectness of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item