Improved bounds for the chromatic index of graphs and multigraphs
From MaRDI portal
Publication:4719322
DOI<311::AID-JGT1>3.0.CO;2-X 10.1002/(SICI)1097-0118(199912)32:4<311::AID-JGT1>3.0.CO;2-XzbMath0934.05053OpenAlexW4244004012MaRDI QIDQ4719322
Edward F. Schmeichel, S. Louis Hakimi
Publication date: 9 April 2000
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199912)32:4<311::aid-jgt1>3.0.co;2-x
Related Items (4)
\(f\)-colorings of some graphs of \(f\)-class 1 ⋮ Some graphs of class 1 for \(f\)-colorings ⋮ Graphs of \(f\)-class 1 ⋮ Equitable edge-colorings of simple graphs
Cites Work
- Unnamed Item
- On the \(\Delta\)-subgraph of graphs which are critical with respect to the chromatic index
- Data transfers in networks
- Class one graphs
- Edge-coloring of multigraphs: Recoloring technique
- A short proof for a generalization of Vizing's theorem
- A generalization of edge-coloring in graphs
- The NP-Completeness of Edge-Coloring
- On edge-colorings of graphs.
- Degree‐bounded coloring of graphs: Variations on a theme by brooks
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- An inequality for the chromatic number of a graph
- k-Degenerate Graphs
- A Theorem on Coloring the Lines of a Network
This page was built for publication: Improved bounds for the chromatic index of graphs and multigraphs
