Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
From MaRDI portal
Publication:709301
DOI10.1016/J.DISC.2010.03.021zbMATH Open1203.05048OpenAlexW2095074152MaRDI QIDQ709301FDOQ709301
Authors: Oleg V. Borodin, A. N. Glebov, André Raspaud 
Publication date: 18 October 2010
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2010.03.021
Recommendations
- Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
- Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable
- On 3-colorable plane graphs without 5- and 7-cycles
- Planar graphs without adjacent cycles of length at most seven are 3-colorable
- Planar graphs without cycles of length from 4 to 7 are 3-colorable
Cites Work
- 25 pretty graph colouring problems
- Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
- Title not available (Why is that?)
- Coloring graphs with fixed genus and girth
- On a conjecture of B. Grünbaum
- On 3-colorable plane graphs without 5- and 7-cycles
- A sufficient condition for planar graphs to be 3-colorable
- Planar graphs without cycles of length from 4 to 7 are 3-colorable
- A note on the three color problem
- Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable
- Title not available (Why is that?)
- Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
- Title not available (Why is that?)
- Title not available (Why is that?)
- A 3-color theorem on plane graphs without 5-circuits
- Planar graphs without adjacent cycles of length at most seven are 3-colorable
- Title not available (Why is that?)
- The color space of a graph
- Continuation of a 3-coloring from a 7-face onto a plane graph without \(C_3\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (23)
- Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable
- Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable
- Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
- A sufficient condition for a planar graph to be 3-colorable
- Plane graphs without 4- and 5-cycles and without ext-triangular 7-cycles are 3-colorable
- The 3-colorability of planar graphs without cycles of length 4, 6 and 9
- Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
- Steinberg's conjecture is false
- On 3-colorability of planar graphs without adjacent short cycles
- Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable
- A refinement of choosability of graphs
- Planar graphs without short even cycles are near-bipartite
- Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph
- A relaxation of Novosibirsk 3-color conjecture
- A step towards the strong version of Havel's three color conjecture
- Distance constraints on short cycles for 3-colorability of planar graphs
- \((1,0,0)\)-colorability of planar graphs without prescribed short cycles
- Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
- Planar graphs without cycles of length from 4 to 7 and intersecting triangles are DP-3-colorable
- Planar graphs without adjacent cycles of length at most seven are 3-colorable
- Short proofs of coloring theorems on planar graphs
- Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable
- Planar graphs without cycles of length from 4 to 7 are 3-colorable
This page was built for publication: Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709301)
