Pack graphs with subgraphs of size three
From MaRDI portal
Recommendations
- On the packing of three graphs
- Packing of three copies of a graph
- Packing three-vertex paths in a subcubic graph
- scientific article; zbMATH DE number 734474
- On packing 3-vertex paths in a graph
- All \(P_{3}\)-equipackable graphs
- Packing chromatic number of subdivisions of cubic graphs
- Packing graphs in their complements
- Packing chromatic number of base-3 Sierpiński graphs
- Packings and coverings of complete 3-uniform hypergraph
Cites work
- scientific article; zbMATH DE number 3710227 (Why is no real title available?)
- scientific article; zbMATH DE number 25257 (Why is no real title available?)
- scientific article; zbMATH DE number 3503285 (Why is no real title available?)
- scientific article; zbMATH DE number 749307 (Why is no real title available?)
- scientific article; zbMATH DE number 969114 (Why is no real title available?)
- scientific article; zbMATH DE number 3218576 (Why is no real title available?)
- A note on edge-decompositions of planar graphs
- Claw‐decompositions and tutte‐orientations
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- Decomposing Complete Graphs Into Cycles of Length 2P
- Decomposing complete equipartite graphs into cycles of length2p
- Decomposing cubic graphs into connected subgraphs of size three
- Decomposing series-parallel graphs into paths of length 3 and triangles
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- Decomposition of complete graphs into paths and stars
- Decomposition of complete multigraphs into stars
- Decompositions of highly connected graphs into paths of length 3
- Graph theory with applications
- Multidecomposition of \(\lambda K_m\) into small cycles and claws
- Multidesigns for graph-pairs of order 4 and 5
- On claw-decomposition of a complete multi-partite graph
- On claw-decomposition of complete graphs and complete bigraphs
- On decomposing even regular multigraphs into small isomorphic trees
- On the construction of odd cycle systems
- On the decomposition of a graph into stars
- P4-decompositions of regular graphs
- Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts
- Some observations on the oberwolfach problem
- The Oberwolfach problem and factors of uniform odd length cycles
- The complexity of \(P_{4}\)-decomposition of regular graphs and multigraphs
- The spectrum for 2-perfect 6-cycle systems
- \(C_{p}\)-decompositions of some regular graphs
- \(G\)-decomposition of \(K_n\), where G has four vertices or less
This page was built for publication: Pack graphs with subgraphs of size three
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1990360)
