The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability
From MaRDI portal
Publication:6616225
DOI10.7155/JGAA.V28I1.2931zbMATH Open1548.05133MaRDI QIDQ6616225
Publication date: 8 October 2024
Published in: (Search for Journal in Brave)
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?)
- Corrigendum to: ``On disjoint matchings in cubic graphs
- Exact exponential algorithms.
- 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
- Minimum connected transversals in graphs: new hardness results and tractable cases using the price of connectivity
- 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
- Maximum Δ-edge-colorable subgraphs of class II graphs
- Beyond the Vizing's Bound for at Most Seven Colors
- On the Fine-Grained Complexity of Rainbow Coloring
- The NP-Completeness of Edge-Coloring
- Large Matchings in Graphs
- A survey on snarks and new results: Products, reducibility and a computer search
- Parameterized Algorithms
- A Theorem on Coloring the Lines of a Network
- Spanning trees with many leaves
- Decomposition of class II graphs into two class I graphs
- On an estimate of the chromatic class of a \(p\)-graph
This page was built for publication: The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6616225)