Vizing's coloring algorithm and the fan number
From MaRDI portal
Recommendations
Cites work
- A better than “best possible” algorithm to edge color multigraphs
- A note concerning the chromatic index of multigraphs
- A Theorem on Coloring the Lines of a Network
- An extension of Vizing's adjacency lemma of edge chromatic critical graphs
- Critical star multigraphs
- Edge-coloring of multigraphs
- Edge-coloring of multigraphs: Recoloring technique
- Graph edge coloring. Vizing's theorem and Goldberg's conjecture
- Graph edge colouring: Tashkinov trees and Goldberg's conjecture
- scientific article; zbMATH DE number 1560509 (Why is no real title available?)
- scientific article; zbMATH DE number 866055 (Why is no real title available?)
- Note on the colouring of graphs
- On edge-colorings of graphs.
- On the $1.1$ Edge-Coloring of Multigraphs
- On Vizing's bound for the chromatic index of a multigraph
- Planar graphs of maximum degree seven are Class I
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- The NP-Completeness of Edge-Coloring
- Two Isomorphs of the Four-Colour Problem
- Über eine von H. S. WILF angegebene Schranke für die chromatische Zahl endlicher Graphen
This page was built for publication: Vizing's coloring algorithm and the fan number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3055930)