Bounds on chromatic numbers of multiple factors of a complete graph

DOI10.1002/JGT.3190020103MaRDI QIDQ4154883zbMATHOpenAlexFDO

Authors Ján Plesník

Publication date 1978

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190020103

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Cites work

• Ramsey theory and chromatic numbers

Cited in

(7)

• A Nordhaus-Gaddum-type result for the induced path number
• Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts
• Multiple factor Nordhaus-Gaddum type results for domination and total domination
• scientific article; zbMATH DE number 3683613 (Why is no real title available?)
• Nordhaus-Gaddum-type theorem for diameter of graphs when decomposing into many parts
• Graph factorization and theorems of the Nordhaus-Gaddum class
• Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars

This page was built for publication: Bounds on chromatic numbers of multiple factors of a complete graph

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