scientific article; zbMATH DE number 1990676

MaRDI QIDQ4430837zbMATH OpenFDO

Authors Gary Chartrand, Ladislav Nebeský, Ping Zhang

Publication date 13 October 2003

zbMATH Keywords

detour distanceHamiltonian coloring

Mathematics Subject Classification ID

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

Recommendations

• Hamiltonian colorings of graphs
• On Hamiltonian colorings of trees
• On Hamiltonian colorings for some graphs
• Hamiltonian chromatic number of block graphs
• On Hamiltonian colorings and hc-stable graphs

Cited in

(12)

• On Hamiltonian colorings for some graphs
• Hamiltonian labelings of graphs
• On Hamiltonian colorings of trees
• On Hamiltonian colorings of block graphs
• The k-metric colorings of a graph.
• HAMILTONIAN PROPERTY OF A MAXIMAL GRAPH AND CHROMATIC NUMBER OF ITS LINE GRAPH
• Hamiltonian chromatic number of block graphs
• scientific article; zbMATH DE number 7034394 (Why is no real title available?)
• The hamiltonian chromatic number of a connected graph without large hamiltonian-connected subgraphs
• On Hamiltonian colorings and hc-stable graphs
• On chromatic number and clique number in \(k\)-step Hamiltonian graphs
• Chromatic properties of Hamiltonian graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4430837)