Greedy \(F\)-colorings of graphs

DOI10.1016/S0012-365X(03)00182-1zbMath1029.05048OpenAlexW2021339430MaRDI QIDQ1415540

Ping Zhang, Ladislav Nebeský, Gary Chartrand

Publication date: 4 December 2003

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00182-1

zbMATH Keywords

\(F\)-coloring\(F\)-chromatic numberGreedy \(F\)-chromatic numberGreedy \(F\)-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

On Hamiltonian colorings of graphs

Cites Work

• Ordered colourings of graphs
• Hamiltonian colorings of graphs
• On the equality of the grundy and ochromatic numbers of a graph
• Labelling Graphs with a Condition at Distance 2
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Greedy \(F\)-colorings of graphs