On Hamiltonian colorings of graphs

DOI10.1016/j.disc.2004.10.009zbMath1059.05046OpenAlexW2068421715MaRDI QIDQ1772412

Ping Zhang, Ladislav Nebeský, Gary Chartrand

Publication date: 18 April 2005

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

Full work available at URL: https://doi.org/10.1016/j.disc.2004.10.009

zbMATH Keywords

circumferenceHamiltonian-connected graphsHamiltonian colorings

Mathematics Subject Classification ID

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

Related Items (4)

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A method in graph theory
• Greedy \(F\)-colorings of graphs
• Radio antipodal colorings of graphs
• Graph labeling and radio channel assignment
• Radio k-colorings of paths

This page was built for publication: On Hamiltonian colorings of graphs