Extensions of some factorization results from simple graphs to multigraphs

DOI10.1002/(SICI)1097-0118(199704)24:4%3C291::AID-JGT1%3E3.0.CO;2-JMaRDI QIDQ3129823zbMATH OpenOpenAlexFDO

Authors Shailesh K. Tipnis, S. I. El-Zanati, Michael J. Plantholt

Publication date 15 September 1997

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199704)24:4%3C291::aid-jgt1%3E3.0.co;2-j

zbMATH Keywords

chromatic indexfactorizationHamilton cyclesmultigraphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Factorization of regular multigraphs into regular graphs
• An asymptotic version of the multigraph 1-factorization conjecture
• All regular multigraphs of even order and high degree are 1-factorable
• Semiregular factorizations of regular multigraphs

Cited in

(2)

• Factorization of regular multigraphs into regular graphs
• Green's function approach for quantum graphs: an overview

This page was built for publication: Extensions of some factorization results from simple graphs to multigraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3129823)