scientific article; zbMATH DE number 19203
From MaRDI portal
Publication:3976633
[For the entire collection see Zbl 0734.00014.] We say a graph \(G\) is overfull if size of \(G\) over \(\lfloor{1\over 2} \hbox { order of } G\rfloor\) is greater than maximum vertex degree \(h(G)\) of \(G\). A subgraph \(H\) of \(G\) is called a \(h(G)\)-overfull subgraph of \(G\) if \(H\) is overfull and \(h(H)=h(G)\). There is stated the following conjecture and five striking implications (without proofs) of it. A planar graph \(G\) has chromatic index \(h(G)\) iff \(G\) contains no \(h(G)\)- overfull subgraph.
Recommendations
Cited in
(9)- Recent progress on edge-colouring graphs
- How to find overfull subgraphs in graphs with large maximum degree
- How to find overfull subgraphs in graphs with large maximum degree. II
- Edge colorings of planar graphs with maximum degree five.
- Improved edge-coloring algorithms for planar graphs
- The chromatic index of complete multipartite graphs
- scientific article; zbMATH DE number 1463393 (Why is no real title available?)
- scientific article; zbMATH DE number 1929924 (Why is no real title available?)
- Edge-partitions of planar graphs and their game coloring numbers
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3976633)
