On disjoint matchings in cubic graphs

DOI10.1016/j.disc.2010.02.007zbMath1200.05178OpenAlexW2012370661MaRDI QIDQ968438

Gagik N. Vardanyan, Samvel S. Petrosyan, Vahan V. Mkrtchyan

Publication date: 5 May 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.02.007

zbMATH Keywords

matchingcubic graphpair and triple of matchings

Mathematics Subject Classification ID

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

Related Items

Characterization of saturated graphs related to pairs of disjoint matchings, Maximum Δ-edge-colorable subgraphs of class II graphs, A note on a conjecture on maximum matching in almost regular graphs, Corrigendum to: ``On disjoint matchings in cubic graphs, On maximum matchings in almost regular graphs, Decomposition of class II graphs into two class I graphs, Pairs of disjoint matchings and related classes of graphs, Maximum matchings in regular graphs, On 2-factors with a bounded number of odd components, On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs, On maximum \(k\)-edge-colorable subgraphs of bipartite graphs, On maximum matchings in 5-regular and 6-regular multigraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximum matchings in regular graphs of high girth
• On edge-disjoint pairs of matchings
• Characterization of a class of graphs related to pairs of disjoint matchings
• Matching theory
• Lower bounds on the cardinality of the maximum matchings of planar graphs
• On the maximum matchings of regular multigraphs
• On the maximum number of independent edges in cubic graphs
• Parallel concepts in graph theory
• The edge chromatic difference sequence of a cubic graph
• Measurements of edge-uncolorability
• Parsimonious edge coloring
• A note on minimal matching covered graphs
• On trees with a maximum proper partial 0-1 coloring containing a maximum matching
• Tight lower bounds on the size of a maximum matching in a regular graph
• Unions of perfect matchings in cubic graphs
• The NP-Completeness of Edge-Coloring
• Large Matchings in Graphs
• On the Core of a Graph^†
• A Theorem on Coloring the Lines of a Network