Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture
From MaRDI portal
Publication:526243
DOI10.1016/j.disc.2017.02.020zbMath1361.05053arXiv1510.07017OpenAlexW2107648567WikidataQ123136090 ScholiaQ123136090MaRDI QIDQ526243
Publication date: 10 May 2017
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1510.07017
Related Items
Graphs with \(\alpha _1\) and \(\tau _1\) both large, Graph edge coloring: a survey, Triangle packing and covering in dense random graphs, Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A stability theorem on fractional covering of triangles by edges
- Approximating maximum edge 2-coloring in simple graphs
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Integer and fractional packings in dense graphs
- Approximating the maximum 2- and 3-edge-colorable subgraph problems
- Approximating the maximum 3-edge-colorable subgraph problem
- On a conjecture of Fink and Jacobson concerning k-domination and k- dependence
- Packing and covering triangles in graphs
- On a conjecture of Tuza about packing and covering of triangles
- An application of matching theory of edge-colourings
- Packing and covering triangles in \(K_{4}\)-free planar graphs
- Small edge sets meeting all triangles of a graph
- A conjecture on triangles of graphs
- Tuza's conjecture for graphs with maximum average degree less than 7
- On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs
- A new tool for proving Vizing's theorem
- Maximum Δ-edge-colorable subgraphs of class II graphs
- A short proof for a generalization of Vizing's theorem
- On edge-colorings of graphs.
- Packing Triangles in Weighted Graphs
- Subgraphs with prescribed valencies
