K�nig's edge coloring theorem without augmenting paths

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199810)29:2<87::AID-JGT4>3.0.CO;2-8" /><87::AID-JGT4>3.0.CO;2-8 10.1002/(SICI)1097-0118(199810)29:2<87::AID-JGT4>3.0.CO;2-8zbMath0919.05051OpenAlexW1966190788MaRDI QIDQ4242913

Romeo Rizzi

Publication date: 11 May 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199810)29:2<87::aid-jgt4>3.0.co;2-8

zbMATH Keywords

matchingregular multigraph1-factors

Mathematics Subject Classification ID

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

Related Items (2)

Distributed edge coloration for bipartite networks ⋮ Oriented star packings

This page was built for publication: K�nig's edge coloring theorem without augmenting paths