A new method of proving theorems on chromatic index
From MaRDI portal
(Redirected from Publication:801928)
Recommendations
- A new method for proving chromatic uniqueness of graphs
- scientific article; zbMATH DE number 6988815
- scientific article; zbMATH DE number 1836093
- A generalization of chromatic index
- New bounds for the acyclic chromatic index
- New approximation guarantee for chromatic number
- A new proof of the \(H\)-coloring dichotomy
- A new method for calculating the chromatic polynomial
- New algorithm for calculating chromatic index of graphs and its applications
- A new proof of the colored Kruskal-Katona theorem
Cites work
Cited in
(19)- A game generalizing Hall's theorem
- A comparison of two edge-coloring formulations
- An application of matching theory of edge-colourings
- A generalization of edge-coloring in graphs
- On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs
- A new method for proving chromatic uniqueness of graphs
- Vizing's coloring algorithm and the fan number
- Edge-coloring of multigraphs: Recoloring technique
- A new tool for proving Vizing's theorem
- Kempe classes and almost bipartite graphs
- Tashkinov-trees: an annotated proof
- Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation
- The core conjecture of Hilton and Zhao
- A constructive proof of Vizing's theorem
- Local version of Vizing's theorem for multigraphs
- On fans in multigraphs
- Some consequences of a theorem on fans
- scientific article; zbMATH DE number 3861194 (Why is no real title available?)
- A polyhedral approach to edge coloring
This page was built for publication: A new method of proving theorems on chromatic index
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q801928)
