Hard-to-color graphs for connected sequential colorings

DOI10.1016/0166-218X(94)90090-6zbMath0805.05026OpenAlexW2023692548MaRDI QIDQ1329800

Gottfried Tinhofer, Luitpold Babel

Publication date: 26 January 1995

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

Full work available at URL: https://doi.org/10.1016/0166-218x(94)90090-6

zbMATH Keywords

connected colouringhard-to-colour graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (4)

Hard-to-color graphs for connected sequential colorings ⋮ The smallest hard-to-color graph for the SL algorithm ⋮ The connected greedy coloring game ⋮ Connected greedy coloring of \(H\)-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connected sequential colourings
• The smallest hard-to-color graph
• Parallel concepts in graph theory
• Hard-to-color graphs for connected sequential colorings
• New methods to color the vertices of a graph

This page was built for publication: Hard-to-color graphs for connected sequential colorings