On Colouring Partial Joins of a Complete Graph and a Cycle

DOI10.1002/MANA.19931630111MaRDI QIDQ4302907zbMATH OpenOpenAlexFDO

Authors Michael Stiebitz, Walter Wessel

Publication date 21 August 1994

Published in Mathematische Nachrichten (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/mana.19931630111

zbMATH Keywords

colour-critical graphscomplete graphodd cyclepartial join

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Recommendations

• Total colorings of some join graphs
• scientific article; zbMATH DE number 2362599
• Total colorings of some multi-join graphs
• scientific article; zbMATH DE number 3875311
• On a class of completable partial edge-colourings
• Edge-colouring of join graphs
• A NOTE ON COLOURING OF COMPLETE GRAPHS
• scientific article; zbMATH DE number 169493
• The coloring graph of complete graphs
• Join colourings of chordal graphs

Cited in

(3)

• Gallai's problem on Dirac's construction
• Total colorings of some join graphs
• scientific article; zbMATH DE number 653278 (Why is no real title available?)

This page was built for publication: On Colouring Partial Joins of a Complete Graph and a Cycle

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