Pages that link to "Item:Q4865526"
From MaRDI portal
The following pages link to Structural properties of plane graphs without adjacent triangles and an application to 3-colorings (Q4865526):
Displaying 15 items.
- On 3-colorable planar graphs without prescribed cycles (Q2461207) (← links)
- Planar graphs without 4, 6, 8-cycles are 3-colorable (Q2475310) (← links)
- A note on 3-choosability of planar graphs without certain cycles (Q2566160) (← links)
- A 3-color theorem on plane graphs without 5-circuits (Q2644333) (← links)
- Acyclic choosability of planar graphs: a Steinberg like approach (Q2851463) (← links)
- A note on 3-choosability of plane graphs under distance restrictions (Q2966511) (← links)
- Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable (Q3067058) (← links)
- Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable (Q3652554) (← links)
- Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles (Q4916098) (← links)
- A Complexity Dichotomy for the Coloring of Sparse Graphs (Q4920652) (← links)
- Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable (Q5351865) (← links)
- Plane Triangulations Without a Spanning Halin Subgraph: Counterexamples to the Lovász--Plummer Conjecture on Halin Graphs (Q5502102) (← links)
- A note on list improper coloring planar graphs (Q5938913) (← links)
- Circular coloring and fractional coloring in planar graphs (Q6056812) (← links)
- Light 3-faces in 3-polytopes without adjacent triangles (Q6635125) (← links)
