On disjoint matchings in cubic graphs
type: Item
instance of: scholarly article
title: On disjoint matchings in cubic graphs
zbMATH Open document ID: 1200.05178
author: Samvel S. Petrosyan
author: Gagik N. Vardanyan
author: Vahan V. Mkrtchyan
published in: Discrete Mathematics
publication date: 2010-05-05T00:00:00Z
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 5703962
zbMATH Keywords: matching
zbMATH Keywords: cubic graph
zbMATH Keywords: pair and triple of matchings
MaRDI profile type: Publication
full work available at URL: j.disc.2010.02.007
OpenAlex ID: W2012370661
cites work: Parsimonious edge coloring
cites work: The edge chromatic difference sequence of a cubic graph
cites work: Q3852212
cites work: Maximum matchings in regular graphs of high girth
cites work: Parallel concepts in graph theory
cites work: On the Core of a Graph†
cites work: Tight lower bounds on the size of a maximum matching in a regular graph
cites work: On the maximum number of independent edges in cubic graphs
cites work: The NP-Completeness of Edge-Coloring
cites work: Unions of perfect matchings in cubic graphs
cites work: Matching theory
cites work: On trees with a maximum proper partial 0-1 coloring containing a maximum matching
cites work: A note on minimal matching covered graphs
cites work: On edge-disjoint pairs of matchings
cites work: On the maximum matchings of regular multigraphs
cites work: Lower bounds on the cardinality of the maximum matchings of planar graphs
cites work: A Theorem on Coloring the Lines of a Network
cites work: Measurements of edge-uncolorability
cites work: Characterization of a class of graphs related to pairs of disjoint matchings
cites work: Q4517442
cites work: Large Matchings in Graphs
cites work: Q4869540
DOI: 10.1016/J.DISC.2010.02.007
description: scientific article; zbMATH DE number 5703962