scientific article; zbMATH DE number 2170468
From MaRDI portal
Publication:4677963
zbMATH Open1064.05054MaRDI QIDQ4677963FDOQ4677963
Authors: Gary Chartrand, Ladislav Nebeský, Ping Zhang
Publication date: 23 May 2005
Title of this publication is not available (Why is that?)
Recommendations
Eulerian and Hamiltonian graphs (05C45) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cited In (12)
- Hamiltonian completion
- Hamiltonian fuzzy partition coloring
- Title not available (Why is that?)
- On Hamiltonian colorings for some graphs
- On Hamiltonian colorings and hc-stable graphs
- On Hamiltonian colorings of trees
- The hamiltonicity and path \(t\)-coloring of Sierpiński-like graphs
- Hamiltonian colorings of graphs
- On Hamiltonian colorings of graphs
- Title not available (Why is that?)
- Hamiltonian chromatic number of block graphs
- The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem
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 Q4677963)