Decomposition of the Johnson graphs into graph-pairs of order 4

DOI10.1007/978-3-031-52969-6_6MaRDI QIDQ6616802zbMATH OpenFDO

Authors Atif A. Abueida, Mike Daven

Publication date 9 October 2024

Full work available at URL https://doi.org/10.1007/978-3-031-52969-6_6

zbMATH Keywords

decompositionsgraph designsJohnson graph

Mathematics Subject Classification ID

Graph designs and isomorphic decomposition (05C51) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Primitive decompositions of Johnson graphs
• Decompositions of complete graphs with holes of the same size into the graph-pair of order 4
• Multidecomposition of the complete graph into graph pairs of order 4 with various leaves.
• Multidesigns for graph-pairs of order 4 and 5
• Multidecomposition of K_n-F into graph-pairs of order 5 where F is a Hamilton cycle or an (almost) 1-factor.

Cites work

• Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars
• Decomposition of complete bipartite graphs into paths and cycles
• Decomposition of complete graphs into cycles and stars
• Decomposition of complete graphs into paths and stars
• Decomposition of product graphs into paths and cycles of length four
• Decomposition of the complete bipartite graph with a 1-factor removed into cycles and stars
• Decompositions of complete graphs into paths and cycles.
• Hamiltonian decompositions of complete graphs
• scientific article; zbMATH DE number 124520 (Why is no real title available?)
• scientific article; zbMATH DE number 1096962 (Why is no real title available?)
• scientific article; zbMATH DE number 867473 (Why is no real title available?)
• Maximal sets of 2-factors and Hamiltonian cycles
• Multidecompositions of several graph products
• Multidesigns for graph-pairs of order 4 and 5
• New bounds on clique-chromatic numbers of Johnson graphs
• New lower bound on the modularity of Johnson graphs
• Packing and covering the balanced complete bipartite multigraph with cycles and stars
• Perfect 3-colorings of the Johnson graph \(J(6, 3)\)

Cited in

(1)

• On decompositions of the Johnson graph

This page was built for publication: Decomposition of the Johnson graphs into graph-pairs of order 4

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