Pack graphs with subgraphs of size three
From MaRDI portal
Publication:1990360
DOI10.11650/tjm/8093zbMath1398.05129OpenAlexW2750197996MaRDI QIDQ1990360
Zhen-Chun Chen, Kuo-Ching Huang, Hung-Lin Fu
Publication date: 25 October 2018
Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.twjm/1502935238
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph designs and isomorphic decomposition (05C51)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Decomposing series-parallel graphs into paths of length 3 and triangles
- Path and cycle decompositions of complete equipartite graphs: 3 and 5 parts
- Decomposition of complete graphs into paths and stars
- Decomposition of complete multigraphs into stars
- Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k
- On the decomposition of a graph into stars
- The spectrum for 2-perfect 6-cycle systems
- On claw-decomposition of complete graphs and complete bigraphs
- \(G\)-decomposition of \(K_n\), where G has four vertices or less
- On claw-decomposition of a complete multi-partite graph
- Multidesigns for graph-pairs of order 4 and 5
- The Oberwolfach problem and factors of uniform odd length cycles
- A note on edge-decompositions of planar graphs
- Cycle decompositions of \(K_n\) and \(K_n-I\)
- \(C_{p}\)-decompositions of some regular graphs
- On decomposing even regular multigraphs into small isomorphic trees
- Decomposing Cubic Graphs into Connected Subgraphs of Size Three
- On the construction of odd cycle systems
- Decomposing complete equipartite graphs into cycles of length2p
- Decompositions of highly connected graphs into paths of length 3
- Some observations on the oberwolfach problem
- Decomposing Complete Graphs Into Cycles of Length 2P
- P4-decompositions of regular graphs
- Claw‐decompositions and tutte‐orientations
This page was built for publication: Pack graphs with subgraphs of size three