Detachments of Complete Graphs

DOI10.1017/S0963548304006558MaRDI QIDQ4680568zbMATH OpenWikidataFDO

Authors Keith Edwards

Publication date 7 June 2005

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548304006558

zbMATH Keywords

exact colouringharmonious colouring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Amalgamations of almost regular edge-colourings of simple graphs
• Non-separable detachments of graphs
• Some Theorems on Detachments Preserving Local-Edge-Connectivity
• Detachments of hypergraphs I: The Berge-Johnson problem
• Highly edge-connected detachments of graphs and digraphs

Cited in

(10)

• Triangulating remnants of complete graphs
• Non-separable detachments of graphs
• Detachments of hypergraphs I: The Berge-Johnson problem
• Achromatic number of fragmentable graphs
• scientific article; zbMATH DE number 3914375 (Why is no real title available?)
• Achromatic number of collections of paths and cycles
• Achromatic and harmonious colorings of circulant graphs
• Completely Disconnecting the Complete Graph
• Harmonious and achromatic colorings of fragmentable hypergraphs
• Coloring of n-inordinate invariant intersection graphs

This page was built for publication: Detachments of Complete Graphs

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