K�nig's edge coloring theorem without augmenting paths

DOI<87::AID-JGT4>3.0.CO;2-8 10.1002/(SICI)1097-0118(199810)29:2<87::AID-JGT4>3.0.CO;2-8zbMath0919.05051MaRDI 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

matching; regular multigraph; 1-factors

Mathematics Subject Classification ID

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

05C15: Coloring of graphs and hypergraphs

Related Items

Distributed edge coloration for bipartite networks, Oriented star packings