K�nig's edge coloring theorem without augmenting paths

DOI10.1002/(SICI)1097-0118(199810)29:2%3C87::AID-JGT4%3E3.0.CO;2-8zbMATH Open0919.05051OpenAlexW1966190788MaRDI QIDQ4242913FDOQ4242913

Romeo Rizzi

Publication date: 11 May 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199810)29:2%3C87::aid-jgt4%3E3.0.co;2-8

zbMATH Keywords

matching1-factorsregular multigraph

Mathematics Subject Classification ID

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

Cited In (3)

• Distributed edge coloration for bipartite networks
• Oriented star packings
• Kőnig's edge-colouring theorem for all graphs

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

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