Extensions of some factorization results from simple graphs to multigraphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199704)24:4<291::AID-JGT1>3.0.CO;2-J" /><291::AID-JGT1>3.0.CO;2-J 10.1002/(SICI)1097-0118(199704)24:4<291::AID-JGT1>3.0.CO;2-JzbMath0870.05056OpenAlexW4243103456MaRDI QIDQ3129823

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

Publication date: 15 September 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199704)24:4<291::aid-jgt1>3.0.co;2-j

zbMATH Keywords

factorizationmultigraphschromatic indexHamilton cycles

Mathematics Subject Classification ID

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

Related Items (1)

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