Pages that link to "Item:Q526243"
From MaRDI portal
The following pages link to Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture (Q526243):
Displaying 10 items.
- The maximal clique and colourability of curve contact graphs (Q1382253) (← links)
- Maximal edge-colorings of graphs (Q1696530) (← links)
- Graph edge coloring: a survey (Q1733850) (← links)
- Triangle packing and covering in dense random graphs (Q2084667) (← links)
- Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number (Q2091099) (← links)
- Maximal ambiguously \(k\)-colorable graphs (Q2284731) (← links)
- Graphs with \(\alpha _1\) and \(\tau _1\) both large (Q2413631) (← links)
- A new tool for proving Vizing's theorem (Q2449145) (← links)
- Maximum \(\Delta \)-edge-colorable subgraphs of class II graphs (Q2911495) (← links)
- KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS (Q2971036) (← links)
