P4-decompositions of regular graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199906)31:2<135::AID-JGT6>3.0.CO;2-I" /><135::AID-JGT6>3.0.CO;2-I 10.1002/(SICI)1097-0118(199906)31:2<135::AID-JGT6>3.0.CO;2-IzbMath0927.05067OpenAlexW4252326788MaRDI QIDQ4248537

Katherine Heinrich, Min-Li Yu, Ji Ping Liu

Publication date: 5 December 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199906)31:2<135::aid-jgt6>3.0.co;2-i

zbMATH Keywords

decompositionregular graphspathEuler tour

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Eulerian and Hamiltonian graphs (05C45)

Related Items (14)

Path decompositions of regular graphs with prescribed girth ⋮ P₄-Decomposition of Total Graphs ⋮ Decomposing regular graphs with prescribed girth into paths of given length ⋮ Multidecompositions of the balanced complete bipartite graph into paths and stars ⋮ Decomposing graphs into paths of fixed length ⋮ Decompositions of complete bipartite graphs and complete graphs into paths, stars, and cycles with four edges each ⋮ Pack graphs with subgraphs of size three ⋮ Decomposing highly connected graphs into paths of length five ⋮ Unnamed Item ⋮ Codes for distributed storage from 3-regular graphs ⋮ Unnamed Item ⋮ A note on edge-decompositions of planar graphs ⋮ Decomposition of 4k-regular graphs into k 4-regular K5-free and (K5 − e)-free subgraphs ⋮ Decompositions of triangle-free 5-regular graphs into paths of length five

Cites Work

• Unnamed Item

This page was built for publication: P4-decompositions of regular graphs