Pages that link to "Item:Q998606"
From MaRDI portal
The following pages link to On 3-colorable planar graphs without short cycles (Q998606):
Displaying 18 items.
- Three-colourability of planar graphs with no 5- or triangular \(\{3,6\}\)-cycles (Q324868) (← 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)
- Cycle adjacency of planar graphs and 3-colourability (Q647258) (← links)
- A counterexample to the conjecture of Aksionov and Mel'nikov on non-3- colorable planar graphs (Q793751) (← links)
- Three-coloring planar graphs without short cycles (Q845915) (← links)
- On 3-colorable plane graphs without 5- and 7-cycles (Q859619) (← links)
- On 3-colorability of planar graphs without adjacent short cycles (Q977289) (← links)
- Planar graphs without adjacent cycles of length at most seven are 3-colorable (Q1045158) (← links)
- A sufficient condition for planar graphs to be 3-colorable (Q1405097) (← links)
- A step towards the strong version of Havel's three color conjecture (Q1931401) (← links)
- Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph (Q2274084) (← links)
- On 3-colorable planar graphs without cycles of four lengths (Q2379960) (← links)
- Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
- Short proofs of coloring theorems on planar graphs (Q2441638) (← links)
- On the 3-colorability of planar graphs without \(\{4,8,9\}\)-cycles (Q2859766) (← links)
- Planar graph colorings without short monochromatic cycles (Q4736767) (← links)
- (Q4797465) (← links)
