How to find overfull subgraphs in graphs with large maximum degree
From MaRDI portal
Publication:1329811
DOI10.1016/0166-218X(94)90101-5zbMath0805.05032DBLPjournals/dam/Niessen94WikidataQ62638538 ScholiaQ62638538MaRDI QIDQ1329811
Publication date: 20 September 1994
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (9)
The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\) ⋮ On the chromatic index of cographs and join graphs ⋮ Vertex-splitting and chromatic index critical graphs ⋮ A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian—An Approach to Vizing's 2‐Factor Conjecture ⋮ Edge-colouring graphs with bounded local degree sums ⋮ On the conformability of regular line graphs ⋮ Optimal path and cycle decompositions of dense quasirandom graphs ⋮ On the chromatic index of join graphs and triangle-free graphs with large maximum degree ⋮ Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time
Cites Work
- Unnamed Item
- Unnamed Item
- The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small
- 1-factorizing regular graphs of high degree - an improved bound
- Two conjectures on edge-colouring
- Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree
- The NP-Completeness of Edge-Coloring
- On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
- The chromatic index of graphs of even order with many edges
- A Graph-Theoretic Approach to a Communications Problem
This page was built for publication: How to find overfull subgraphs in graphs with large maximum degree
