Hamiltonian colorings of graphs

DOI10.1016/j.dam.2004.08.007zbMath1056.05054OpenAlexW2061630761MaRDI QIDQ1763479

Ladislav Nebeský, Ping Zhang, Gary Chartrand

Publication date: 22 February 2005

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

Full work available at URL: https://doi.org/10.1016/j.dam.2004.08.007

zbMATH Keywords

Hamiltonian-connected graphsHamiltonian coloringRadio 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 (7)

Unnamed Item ⋮ Some new results on colour-induced signed graphs ⋮ Greedy \(F\)-colorings of graphs ⋮ The hamiltonian chromatic number of a connected graph without large hamiltonian-connected subgraphs ⋮ On Hamiltonian Colorings of Trees ⋮ On Hamiltonian Colorings of Block Graphs ⋮ On Hamiltonian colorings for some graphs

Cites Work

• Radio antipodal colorings of graphs
• Radio k-colorings of paths
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hamiltonian colorings of graphs