Pages that link to "Item:Q2644333"
From MaRDI portal
The following pages link to A 3-color theorem on plane graphs without 5-circuits (Q2644333):
Displayed 19 items.
- Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589) (← links)
- Acyclic total colorings of planar graphs without \(l\) cycles (Q475741) (← links)
- A sufficient condition on 3-colorable plane graphs without 5- and 6-circuits (Q477505) (← links)
- Distance constraints on short cycles for 3-colorability of planar graphs (Q497344) (← links)
- Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable (Q709301) (← links)
- Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable (Q738860) (← links)
- On 3-colorable plane graphs without 5- and 7-cycles (Q859619) (← links)
- Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable (Q898165) (← links)
- \(f\)-colorings of some graphs of \(f\)-class 1 (Q943513) (← links)
- A structural theorem on embedded graphs and its application to colorings (Q1034219) (← links)
- Symmetry and transitive properties of monohedral \(f\)-triangulations of the Riemannian sphere (Q1044334) (← links)
- Planar graphs without adjacent cycles of length at most seven are 3-colorable (Q1045158) (← links)
- A step towards the strong version of Havel's three color conjecture (Q1931401) (← links)
- Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable (Q2279984) (← links)
- A relaxation of the Bordeaux conjecture (Q2349972) (← links)
- Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
- (Q2857451) (← links)
- Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable (Q3067058) (← links)
- A NOTE ON 3-COLORABLE PLANE GRAPHS WITHOUT 5- AND 7-CYCLES (Q3646205) (← links)