Generalized k-tuple colorings of cycles and other graphs

DOI10.1016/0095-8956(82)90079-XzbMATH Open0465.05032MaRDI QIDQ1154475FDOQ1154475

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

Cites Work

• Title not available (Why is that?)
• On Complementary Graphs
• n-tuple colorings and associated graphs
• Set colourings of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (6)

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

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

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