Clique partitions of distance multigraphs

DOI10.1016/j.disc.2007.06.028zbMath1155.05035OpenAlexW2134619820MaRDI QIDQ932596

David A. Gregory, Sarah E. Vanderlinde, Randall J. Elzinga, Michael S. Cavers, Kevin N. Vander Meulen

Publication date: 11 July 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.06.028

zbMATH Keywords

set intersectionsaddressingclique partitionsdistance multigraphsfractional clique partitions

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof of the squashed cube conjecture
• Minimal clique partitions and pairwise balanced designs
• Clique partitions and clique coverings
• Subsets of a finite set that almost always intersect each other in \(\lambda\) elements
• Addressing the Petersen graph
• Fractional biclique covers and partitions of graphs
• The NP-Completeness of Some Edge-Partition Problems
• On the Decomposition of Graphs
• The Representation of a Graph by Set Intersections
• On the Addressing Problem for Loop Switching

This page was built for publication: Clique partitions of distance multigraphs