Decomposition of the Johnson graphs into graph-pairs of order 4
From MaRDI portal
Publication:6616802
DOI10.1007/978-3-031-52969-6_6zbMATH Open1548.0526MaRDI QIDQ6616802
Publication date: 9 October 2024
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph designs and isomorphic decomposition (05C51)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decomposition of the complete bipartite graph with a 1-factor removed into cycles and stars
- Decomposition of complete bipartite graphs into paths and cycles
- Hamiltonian decompositions of complete graphs
- Perfect 3-colorings of the Johnson graph \(J(6, 3)\)
- Decomposition of complete graphs into paths and stars
- Maximal sets of 2-factors and Hamiltonian cycles
- Multidesigns for graph-pairs of order 4 and 5
- Decomposition of complete graphs into cycles and stars
- Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars
- New bounds on clique-chromatic numbers of Johnson graphs
- New lower bound on the modularity of Johnson graphs
- Multidecompositions of several graph products
- Decomposition of product graphs into paths and cycles of length four
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)
