A new method of proving theorems on chromatic index
From MaRDI portal
Publication:801928
DOI10.1016/0012-365X(84)90078-5zbMATH Open0553.05035MaRDI QIDQ801928FDOQ801928
Authors: Andrzej Ehrenfeucht, Vance Faber, H. A. Kierstead 
Publication date: 1984
Published in: Discrete Mathematics (Search for Journal in Brave)
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 (17)
- 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
- Kempe classes and almost bipartite graphs
- A new tool for proving Vizing's theorem
- 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
- On fans in multigraphs
- Title not available (Why is that?)
- Some consequences of a theorem on fans
- 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)
