Pages that link to "Item:Q3113286"
From MaRDI portal
The following pages link to On characterizing Vizing's edge colouring bound (Q3113286):
Displaying 14 items.
- Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture (Q526243) (← links)
- Achieving maximum chromatic index in multigraphs (Q1025461) (← links)
- On Vizing's bound for the chromatic index of a multigraph (Q1044923) (← links)
- Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most \(3\) (Q1584243) (← links)
- Graph edge coloring: a survey (Q1733850) (← links)
- The maximum chromatic index of multigraphs with given \(\Delta \) and \(\mu \) (Q1926022) (← links)
- A refinement of Vizing's theorem (Q1978167) (← links)
- Structural properties of edge-chromatic critical multigraphs (Q2338635) (← links)
- A Vizing-like theorem for union vertex-distinguishing edge coloring (Q2410224) (← links)
- Edge coloring multigraphs without small dense subsets (Q2515595) (← links)
- KŐNIG’S LINE COLORING AND VIZING’S THEOREMS FOR GRAPHINGS (Q2971036) (← links)
- On a theorem of Goldberg (Q3174233) (← links)
- A generalization of edge-coloring in graphs (Q3735724) (← links)
- Orientation‐based edge‐colorings and linear arboricity of multigraphs (Q6094040) (← links)
