Pages that link to "Item:Q3351376"
From MaRDI portal
The following pages link to A short proof for a generalization of Vizing's theorem (Q3351376):
Displaying 17 items.
- Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture (Q526243) (← links)
- A constructive proof of Vizing's theorem (Q1186590) (← links)
- On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs (Q1363709) (← links)
- Chromatic index of hypergraphs and Shannon's theorem (Q1580680) (← links)
- Extension from precoloured sets of edges (Q1658745) (← links)
- A Vizing-type theorem for matching forests (Q1861260) (← links)
- An application of matching theory of edge-colourings (Q1923520) (← links)
- A refinement of Vizing's theorem (Q1978167) (← links)
- Chromatic index of simple hypergraphs (Q2005680) (← links)
- Data migration on parallel disks: Algorithms and evaluation (Q2369881) (← links)
- Edge-coloring of multigraphs (Q2570119) (← links)
- KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS (Q2971036) (← links)
- Solution of Vizing's Problem on Interchanges for the case of Graphs with Maximum Degree 4 and Related Results (Q3188669) (← links)
- A generalization of edge-coloring in graphs (Q3735724) (← links)
- (Q4020256) (← links)
- Improved bounds for the chromatic index of graphs and multigraphs (Q4719322) (← links)
- Precoloring extension of Vizing's theorem for multigraphs (Q6612306) (← links)