Name
Abstract | ||
|---|---|---|
The existence of an overfull subgraph of a simple graph implies χ′ Δ+1, where χ′ denotes the chromatic index and Δ the maximum degree. A fast algorithm for finding overfull subgraphs of simple graphs with 2Δ⩾| V |is presented. |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1016/0166-218X(94)90101-5 | Discrete Applied Mathematics |
Keywords | Field | DocType |
overfull subgraphs,large maximum degree,linear time,maximum degree | Discrete mathematics,Graph,Edge coloring,Combinatorics,Degree (graph theory),Time complexity,Conjecture,Mathematics | Journal |
Volume | Issue | ISSN |
51 | 1 | Discrete Applied Mathematics |
Citations | PageRank | References |
9 | 0.85 | 10 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Thomas Niessen | 1 | 164 | 18.28 |