On disjoint matchings in cubic graphs
From MaRDI portal
Publication:968438
DOI10.1016/J.DISC.2010.02.007zbMATH Open1200.05178OpenAlexW2012370661MaRDI QIDQ968438FDOQ968438
Authors: Samvel S. Petrosyan, Gagik N. Vardanyan, 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
Recommendations
Cites Work
- Matching theory
- On trees with a maximum proper partial 0-1 coloring containing a maximum matching
- Title not available (Why is that?)
- The NP-Completeness of Edge-Coloring
- Title not available (Why is that?)
- Parallel concepts in graph theory
- Measurements of edge-uncolorability
- Title not available (Why is that?)
- A Theorem on Coloring the Lines of a Network
- Maximum matchings in regular graphs of high girth
- Tight lower bounds on the size of a maximum matching in a regular graph
- On the maximum number of independent edges in cubic graphs
- Lower bounds on the cardinality of the maximum matchings of planar graphs
- On edge-disjoint pairs of matchings
- Parsimonious edge coloring
- On the Core of a Graph†
- Characterization of a class of graphs related to pairs of disjoint matchings
- On the maximum matchings of regular multigraphs
- The edge chromatic difference sequence of a cubic graph
- A note on minimal matching covered graphs
- Unions of perfect matchings in cubic graphs
- Large Matchings in Graphs
Cited In (23)
- A note on a conjecture on maximum matching in almost regular graphs
- On maximum matchings in 5-regular and 6-regular multigraphs
- On maximum \(k\)-edge-colorable subgraphs of bipartite graphs
- Maximum matchings in regular graphs
- Minimum maximal matchings in cubic graphs
- Pairs of disjoint matchings and related classes of graphs
- Disjoint triangles of a cubic line graph
- Title not available (Why is that?)
- Characterization of saturated graphs related to pairs of disjoint matchings
- Induced matchings in subcubic graphs
- On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs
- Graphs, disjoint matchings and some inequalities
- The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability
- On 2-factors with a bounded number of odd components
- Maximum \(\Delta \)-edge-colorable subgraphs of class II graphs
- Covering cubic graphs with matchings of large size
- Unions of perfect matchings in cubic graphs
- On intersection graphs of 2-matchings in cubic graphs
- Decomposition of class II graphs into two class I graphs
- On maximum matchings in cubic graphs with a bounded number of bridge-covering paths
- How many disjoint 2-edge paths must a cubic graph have?
- Corrigendum to: ``On disjoint matchings in cubic graphs
- On maximum matchings in almost regular graphs
This page was built for publication: On disjoint matchings in cubic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968438)
