Further studies on chromatic completion of graphs

DOI10.1142/S1793830925500326MaRDI QIDQ6840210zbMATH OpenFDO

Authors Toby B. Antony, N. K. Sudev

Publication date 23 March 2026

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830925500326

zbMATH Keywords

chromatic completion graphchromatic completion numberequitable chromatic completion graphequitable chromatic completion numberproper edge

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75)

Cites work

• Algorithmic graph theory and perfect graphs
• Biregular graphs with three eigenvalues
• Cluster graph modification problems
• Equitable Coloring
• On the choosability of complete multipartite graphs with part size three
• The size of connected hypergraphs with prescribed covering number
• The strong perfect graph theorem
• The theory of graphs. Translated from the 1958 French edition by Alison Doig.

This page was built for publication: Further studies on chromatic completion of graphs

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