Planar graphs without cycles of specific lengths
From MaRDI portal
Publication:697075
DOI10.1006/eujc.2002.0570zbMath1001.05042OpenAlexW2068409559MaRDI QIDQ697075
Gašper Fijavž, Riste Škrekovski, Bojan Mohar, Martin Juvan
Publication date: 12 September 2002
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/6b9f37ed98a4d4c279b31b593e4a0b8422c1ea14
Related Items (42)
Two sufficient conditions for a planar graph to be list vertex-2-arborable ⋮ LIST POINT ARBORICITY OF GRAPHS ⋮ Unnamed Item ⋮ Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate ⋮ On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability ⋮ Planar graphs without intersecting 5-cycles are 4-choosable ⋮ On the structure of essentially-highly-connected polyhedral graphs ⋮ \((4,2)\)-choosability of planar graphs with forbidden structures ⋮ Planar graphs without 7-cycles and butterflies are DP-4-colorable ⋮ Find subtrees of specified weight and cycles of specified length in linear time ⋮ 3‐Degenerate induced subgraph of a planar graph ⋮ A sufficient condition for planar graphs to be DP-4-colorable ⋮ Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles ⋮ Choosability in signed planar graphs ⋮ Separating signatures in signed planar graphs ⋮ 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz ⋮ Weak degeneracy of planar graphs without 4- and 6-cycles ⋮ On the vertex-arboricity of planar graphs ⋮ A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles ⋮ Light 3-paths in 3-polytopes without adjacent triangles ⋮ Vertex arboricity of planar graphs without intersecting 5-cycles ⋮ Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate ⋮ The 4-choosability of planar graphs and cycle adjacency ⋮ Planar graphs without chordal 6-cycles are 4-choosable ⋮ A sufficient condition for DP-4-colorability ⋮ A sufficient condition for a planar graph to be 4-choosable ⋮ On 3-choosability of planar graphs without certain cycles ⋮ On planar graphs arbitrarily decomposable into closed trails ⋮ Some sufficient conditions for a planar graph of maximum degree six to be Class 1 ⋮ Choosability of toroidal graphs without short cycles ⋮ Equitable list coloring of planar graphs without 4- and 6-cycles ⋮ Planar graphs without specific cycles are 2-degenerate ⋮ Planar graphs without 4-cycles adjacent to triangles are 4-choosable ⋮ Cycle spectra of contraction-critically 4-connected planar graphs ⋮ DP-4-colorability of planar graphs without adjacent cycles of given length ⋮ DP-4-colorability of two classes of planar graphs ⋮ Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable ⋮ On weak flexibility in planar graphs ⋮ Vertex arboricity of graphs embedded in a surface of non-negative Euler characteristic ⋮ Vertex arboricity of planar graphs without chordal 6-cycles ⋮ Distribution of subtree sums ⋮ Ergodicity of the Wang–Swendsen–Kotecký algorithm on several classes of lattices on the torus
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- List colourings of planar graphs
- The complexity of planar graph choosability
- The 4-choosability of plane graphs without 4-cycles
- Every planar graph is 5-choosable
- Choosability and edge choosability of planar graphs without five cycles
- 3-list-coloring planar graphs of girth 5
- A not 3-choosable planar graph without 3-cycles
- Structural Properties and Edge Choosability of Planar Graphs without 6-Cycles
- Graph colorings with local constraints -- a survey
- 25 pretty graph colouring problems
This page was built for publication: Planar graphs without cycles of specific lengths
