Graphs, disjoint matchings and some inequalities
From MaRDI portal
Publication:6615584
DOI10.56415/BASM.Y2023.I3.P26zbMATH Open1548.05125MaRDI QIDQ6615584
Vahan V. Mkrtchyan, Lianna Hambardzumyan
Publication date: 8 October 2024
Published in: Buletinul Academiei de Științe a Republicii Moldova. Matematica (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Perfect matchings in claw-free cubic graphs
- Maximum matchings in regular graphs of high girth
- On disjoint matchings in cubic graphs
- Approximating the maximum 3-edge-colorable subgraph problem
- Lower bounds on the cardinality of the maximum matchings of planar graphs
- On the maximum matchings of regular multigraphs
- The edge chromatic difference sequence of a cubic graph
- Classification and characterizations of snarks
- On maximum \(k\)-edge-colorable subgraphs of bipartite graphs
- Measurements of edge-uncolorability
- Parsimonious edge coloring
- On parsimonious edge-colouring of graphs with maximum degree three
- On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs
- Tight lower bounds on the size of a maximum matching in a regular graph
- Beyond the Vizing's Bound for at Most Seven Colors
- Graphs with 1-Factors
- Large Matchings in Graphs
- A survey on snarks and new results: Products, reducibility and a computer search
- A Theorem on Coloring the Lines of a Network
- On an estimate of the chromatic class of a \(p\)-graph
This page was built for publication: Graphs, disjoint matchings and some inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6615584)
