On Hamiltonian colorings of graphs
From MaRDI portal
Publication:1772412
DOI10.1016/j.disc.2004.10.009zbMath1059.05046MaRDI 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
05C38: Paths and cycles
05C15: Coloring of graphs and hypergraphs
05C12: Distance in graphs
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
05C45: Eulerian and Hamiltonian graphs
Related Items
On Hamiltonian colorings for some graphs, The hamiltonian chromatic number of a connected graph without large hamiltonian-connected subgraphs
Cites Work