Orthogonal \([k-1,k+1]\)-factorizations in graphs

DOI10.1016/0378-3758(95)00084-4zbMath0852.05071OpenAlexW1983440656WikidataQ114214689 ScholiaQ114214689MaRDI QIDQ1918196

Gui Zhen Liu, Gui Ying Yan

Publication date: 25 November 1996

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0378-3758(95)00084-4

zbMATH Keywords

matchingfactorization

Mathematics Subject Classification ID

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

Related Items (1)

Existence of subgraphs with orthogonal \((g,f)\)-factorization

Cites Work

• Note on Hamilton Circuits
• Subgraphs with prescribed valencies
• Unnamed Item

This page was built for publication: Orthogonal \([k-1,k+1]\)-factorizations in graphs