Edge-disjoint 1-factors in powers of connected graphs

DOI10.21136/cmj.1984.101977zbMath0624.05052OpenAlexW2236480621MaRDI QIDQ3762354

Ladislav Nebeský

Publication date: 1984

Full work available at URL: https://eudml.org/doc/13475

zbMATH Keywords

mutually edge-disjoint 1-factors

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• On the existence of a $3$-factor in the fourth power of a graph
• Graphs with 1-Factors
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Edge-disjoint 1-factors in powers of connected graphs