Chromatic Number and Hamiltonicity of Graphs

zbMATH Open1468.05140arXiv2201.03642MaRDI QIDQ5858884

Author name not available (Why is that?)

Publication date: 14 April 2021

Abstract: Let $G$ be a $k$ - connected ($kgeq2$) graph of order $n$. If $chi(G)geqn-k$, then $G$ is Hamiltonian or $K_{k}vee(K_k^{c}cup{K}_{n-2k})$ with $ngeq2k+1$, where $chi(G)$ is the chromatic number of the graph $G$.

Full work available at URL: https://arxiv.org/abs/2201.03642

zbMATH Keywords

connectivityHamiltonian graphchromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Chromatic properties of Hamiltonian graphs ⋮ HAMILTONIAN PROPERTY OF A MAXIMAL GRAPH AND CHROMATIC NUMBER OF ITS LINE GRAPH ⋮ Title not available (Why is that?)

This page was built for publication: Chromatic Number and Hamiltonicity of Graphs

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