On maximum \(k\)-edge-colorable subgraphs of bipartite graphs
From MaRDI portal
Publication:1730239
DOI10.1016/j.dam.2018.10.013zbMath1406.05032arXiv1807.06556OpenAlexW2884817386MaRDI QIDQ1730239
Liana Karapetyan, Vahan V. Mkrtchyan
Publication date: 11 March 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1807.06556
Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (2)
Characterization of saturated graphs related to pairs of disjoint matchings ⋮ Pairs of disjoint matchings and related classes of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximum matchings in regular graphs of high girth
- Approximating the maximum 2- and 3-edge-colorable subgraph problems
- 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
- 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
- Maximum Δ-edge-colorable subgraphs of class II graphs
- Beyond the Vizing's Bound for at Most Seven Colors
- 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
This page was built for publication: On maximum \(k\)-edge-colorable subgraphs of bipartite graphs
