Generalized n-tuple colorings of a graph: A counterexample to a conjecture of Brigham and Dutton

DOI10.1016/0095-8956(84)90061-3zbMath0553.05037OpenAlexW1964574194MaRDI QIDQ801930

Abdelkader Khelladi, Charles Payan

Publication date: 1984

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(84)90061-3

zbMATH Keywords

(n:i)-chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Generalized k-tuple colorings of cycles and other graphs
• n-tuple colorings and associated graphs
• Unnamed Item
• Unnamed Item