The chromatic index of nearly bipartite multigraphs
From MaRDI portal
Publication:1076034
DOI10.1016/0095-8956(86)90065-1zbMath0593.05029OpenAlexW2021145615MaRDI QIDQ1076034
Larry Eggan, Michael J. Plantholt
Publication date: 1986
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(86)90065-1
Related Items
Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix, Edge-coloring almost bipartite multigraphs, Optimal edge-coloring with edge rate constraints
Cites Work
- Unnamed Item
- Unnamed Item
- The chromatic index of graphs with large maximum degree
- On the edge-chromatic number of a graph
- A generalized construction of chromatic index critical graphs from bipartite graphs
- The NP-Completeness of Edge-Coloring
- The chromatic index of graphs of even order with many edges
- The Solution of a Timetabling Problem
- Decomposition of Finite Graphs Into Forests
- A Theorem on Coloring the Lines of a Network