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

DOI10.1016/0095-8956(84)90061-3zbMATH Open0553.05037OpenAlexW1964574194MaRDI QIDQ801930FDOQ801930

Authors: 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

• Graph theory with applications
• Title not available (Why is that?)
• n-tuple colorings and associated graphs
• Generalized k-tuple colorings of cycles and other graphs

This page was built for publication: Generalized n-tuple colorings of a graph: A counterexample to a conjecture of Brigham and Dutton

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