scientific article; zbMATH DE number 7814343

DOI10.22049/cco.2022.27970.1407MaRDI QIDQ6150893

Hailiza Kamarulhaili, Roslan Hasni, Noor A'lawiah Abd Aziz, Rad Nader Jafari

Publication date: 7 March 2024

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Hamiltonian graphchromatic numberclique number\(k\)-step Hamiltonian graph

Mathematics Subject Classification ID

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

Cites Work

• Graphs with chromatic number close to maximum degree
• Three new upper bounds on the chromatic number
• Advances on the Hamiltonian problem -- a survey
• Bounds for the independence number in \(k\)-step Hamiltonian graphs
• Vertex colouring and forbidden subgraphs -- a survey
• The \(k\)-distance chromatic number of trees and cycles
• New upper bounds for the chromatic number of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: