Graphs whose edge set can be partitioned into maximum matchings

DOI10.1155/2013/358527MaRDI QIDQ1952710zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Abstract: This article provides structural characterization of simple graphs whose edge-set can be partitioned into maximum matchings. We use Vizing's classification of simple graphs based on edge chromatic index.

Cites work

• scientific article; zbMATH DE number 854567 (Why is no real title available?)
• Degrees and matchings
• Graphs with restricted valency and matching number
• On the chromatic index of almost all graphs
• Planar graphs of maximum degree seven are Class I
• The NP-Completeness of Edge-Coloring

Cited in

(2)

• scientific article; zbMATH DE number 1990669 (Why is no real title available?)
• Successive partition of edges of bipartite graph into matchings

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

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