Pseudo-one-factorizations of regular graphs of odd order. II: Products of graphs

DOI10.1016/0012-365X(94)90127-9zbMath0795.05109OpenAlexW2095060170WikidataQ114215611 ScholiaQ114215611MaRDI QIDQ1322199

Guo-Hui Zhang

Publication date: 11 September 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(94)90127-9

zbMATH Keywords

regular graphspseudo-one-factorization

Mathematics Subject Classification ID

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

Cites Work

• On 1-factorability and edge-colorability of Cartesian products of graphs
• One-factorizations of the complete graph—A survey
• 1-Factorizations of cartesian products of regular graphs
• Chromatic Numbers for Certain Graphs
• Edge Coloring Numbers of Some Regular Graphs
• On one‐factorizations of compositions of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pseudo-one-factorizations of regular graphs of odd order. II: Products of graphs