Extremal P₈-free/P₉-free planar graphs
From MaRDI portal
Recommendations
- Extremal \(H\)-free planar graphs
- On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
- Extremal Theta-free planar graphs
- A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable
- Erdős-Gyárfás conjecture for \(P_8\)-free graphs
- Extremal \(C_{4}\)-free/\(C_{5}\)-free planar graphs
- scientific article; zbMATH DE number 6311321
- Backbone coloring of planar graphs for \(C_8\)-free or \(C_9\)-free
- Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
- Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof
Cites work
- Anti-Ramsey numbers of paths and cycles in hypergraphs
- Extremal \(C_{4}\)-free/\(C_{5}\)-free planar graphs
- Extremal \(H\)-free planar graphs
- Extremal Theta-free planar graphs
- scientific article; zbMATH DE number 4200236 (Why is no real title available?)
- Planar Turán numbers of short paths
- The Turán number of disjoint copies of paths
- Turán problems and shadows. II: Trees
Cited in
(3)
This page was built for publication: Extremal \(P_8\)-free/\(P_9\)-free planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6047577)
