On chromatic number and clique number in k-step Hamiltonian graphs

DOI10.22049/CCO.2022.27970.1407MaRDI QIDQ6150893FDOQ6150893

Authors: Noor A'lawiah Abd Aziz, R. Jafari, Hailiza Kamarulhaili, Roslan Hasni 

Publication date: 7 March 2024

Recommendations

• Bounds for the independence number in \(k\)-step Hamiltonian graphs
• Chromatic number and Hamiltonicity of graphs
• Hamiltonian colorings of graphs
• scientific article; zbMATH DE number 7133095
• scientific article; zbMATH DE number 1990676

zbMATH Keywords

chromatic numberclique numberHamiltonian graph\(k\)-step Hamiltonian graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• Graphs \& digraphs
• Vertex colouring and forbidden subgraphs -- a survey
• Graphs with chromatic number close to maximum degree
• Advances on the Hamiltonian problem -- a survey
• New upper bounds for the chromatic number of a graph
• Three new upper bounds on the chromatic number
• Bounds for the independence number in \(k\)-step Hamiltonian graphs
• On \(k\)-step Hamiltonian graphs
• The 2-steps Hamiltonian subdivision graphs of cycles with a chord
• On 2-steps-Hamiltonian cubic graphs
• On \(k\)-step Hamiltonian bipartite and tripartite graphs
• The \(k\)-distance chromatic number of trees and cycles
• On 3-step Hamiltonian trees
• Title not available (Why is that?)

This page was built for publication: On chromatic number and clique number in \(k\)-step Hamiltonian graphs

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