Generalized k-tuple colorings of cycles and other graphs

DOI10.1016/0095-8956(82)90079-XMaRDI QIDQ1154475zbMATH OpenFDO

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

• scientific article; zbMATH DE number 3582190 (Why is no real title available?)
• scientific article; zbMATH DE number 3311772 (Why is no real title available?)
• scientific article; zbMATH DE number 3414305 (Why is no real title available?)
• On Complementary Graphs
• Set colourings of graphs
• n-tuple colorings and associated graphs

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)
• Chromatic invariants for finite graphs: Theme and polynomial variations
• On the Generalized $\vartheta$-Number and Related Problems for Highly Symmetric Graphs
• 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)