Generalized k-tuple colorings of cycles and other graphs

DOI10.1016/0095-8956(82)90079-XzbMath0465.05032MaRDI QIDQ1154475

Robert C. Brigham, Ronald D. Dutton

Publication date: 1982

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

zbMATH Keywords

multicoloring

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15)

Related Items (6)

Chromatic invariants for finite graphs: Theme and polynomial variations ⋮ On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs ⋮ Exact and Parameterized Algorithms for (k, i)-Coloring ⋮ On the tractability of \(( k , i )\)-coloring ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Generalized n-tuple colorings of a graph: A counterexample to a conjecture of Brigham and Dutton

Cites Work

• n-tuple colorings and associated graphs
• Set colourings of graphs
• On Complementary Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalized k-tuple colorings of cycles and other graphs