Clique partitions of distance multigraphs

DOI10.1016/J.DISC.2007.06.028MaRDI QIDQ932596zbMATH OpenOpenAlexFDO

Authors M. Cavers, Randall J. Elzinga, D. A. Gregory, Sarah E. Vanderlinde, 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

addressingclique partitionsdistance multigraphsfractional clique partitionsset intersections

Mathematics Subject Classification ID

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

Recommendations

• Clique decompositions of the distance multigraph of the Cartesian product of graphs
• scientific article; zbMATH DE number 19202
• Asymptotic clique covering ratios of distance graphs
• Pair Labellings with Given Distance
• scientific article; zbMATH DE number 3885943

Cites work

• Addressing the Petersen graph
• Clique partitions and clique coverings
• Fractional biclique covers and partitions of graphs
• scientific article; zbMATH DE number 4008444 (Why is no real title available?)
• scientific article; zbMATH DE number 51878 (Why is no real title available?)
• scientific article; zbMATH DE number 3497901 (Why is no real title available?)
• scientific article; zbMATH DE number 790476 (Why is no real title available?)
• Minimal clique partitions and pairwise balanced designs
• On the Addressing Problem for Loop Switching
• On the Decomposition of Graphs
• Proof of the squashed cube conjecture
• Subsets of a finite set that almost always intersect each other in elements
• The NP-Completeness of Some Edge-Partition Problems
• The Representation of a Graph by Set Intersections

Cited in

(3)

• 4-hyperclique decompositions of 3-hyperdistance multihypergraphs of multipartite graphs
• Clique decompositions of the distance multigraph of the Cartesian product of graphs
• The gap between the minimal dimension of orthonormal labeling and the size of the smallest clique covering of graph

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

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