Graphs whose edge set can be partitioned into maximum matchings

DOI10.1155/2013/358527zbMath1264.05103arXiv1210.4710OpenAlexW2083246313WikidataQ58994940 ScholiaQ58994940MaRDI QIDQ1952710

Niraj Khare

Publication date: 3 June 2013

Published in: ISRN Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1210.4710

zbMATH Keywords

edge partitionedge chromatic indexmaximum mathchingVizing's classification of simple graphs

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Graphs with restricted valency and matching number
• Degrees and matchings
• On the chromatic index of almost all graphs
• Planar graphs of maximum degree seven are Class I
• The NP-Completeness of Edge-Coloring

This page was built for publication: Graphs whose edge set can be partitioned into maximum matchings