On Hamiltonian-colored graphs

MaRDI QIDQ5419836zbMATH OpenFDO

Authors Ryan Jones, Kyle Kolasinski, Ping Zhang

Publication date 11 June 2014

zbMATH Keywords

Hamiltonian cycle

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• On the Hamiltonicity of distance-colored graphs
• Hamiltonian-colored powers of strong digraphs
• On properly colored Hamiltonian cycles in cubes of distance-colored grids
• Hamiltonian colorings of graphs
• On Hamiltonian colorings of trees

Cited in

(9)

• On Hamiltonian colorings for some graphs
• Hamiltonian colorings of graphs
• Monochromatic Hamiltonian Berge-cycles in colored hypergraphs
• On properly colored Hamiltonian cycles in cubes of distance-colored grids
• Hamiltonian-colored powers of strong digraphs
• On the Hamiltonicity of distance-colored graphs
• The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem
• The hamiltonicity and path t-coloring of Sierpiński-like graphs
• Chromatic properties of Hamiltonian graphs

This page was built for publication: On Hamiltonian-colored graphs

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