Bounds on chromatic numbers of multiple factors of a complete graph

DOI10.1002/JGT.3190020103zbMath0375.05027OpenAlexW2002344418MaRDI QIDQ4154883

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)

Related Items (7)

NORDHAUS–GADDUM-TYPE THEOREM FOR DIAMETER OF GRAPHS WHEN DECOMPOSING INTO MANY PARTS ⋮ Unnamed Item ⋮ A Nordhaus-Gaddum-type result for the induced path number ⋮ Multiple factor Nordhaus-Gaddum type results for domination and total domination ⋮ Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three 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

Cites Work

• Ramsey theory and chromatic numbers

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