Planar graphs without cycles of specific lengths
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 446487 (Why is no real title available?)
- scientific article; zbMATH DE number 1341914 (Why is no real title available?)
- scientific article; zbMATH DE number 890665 (Why is no real title available?)
- 25 pretty graph colouring problems
- 3-list-coloring planar graphs of girth 5
- A not 3-choosable planar graph without 3-cycles
- Choosability and edge choosability of planar graphs without five cycles
- Every planar graph is 5-choosable
- Graph colorings with local constraints -- a survey
- List colourings of planar graphs
- Structural properties and edge choosability of planar graphs without 6-cycles
- The 4-choosability of plane graphs without 4-cycles
- The complexity of planar graph choosability
Cited in
(45)- On 3-choosability of planar graphs without certain cycles
- Weak degeneracy of planar graphs without 4- and 6-cycles
- On the vertex-arboricity of planar graphs
- Two sufficient conditions for a planar graph to be list vertex-2-arborable
- Choosability of toroidal graphs without short cycles
- 4-choosability of planar graphs with 4-cycles far apart via the Combinatorial Nullstellensatz
- Cycles in 3-connected claw-free planar graphs and 4-connected planar graphs without 4-cycles
- \((4,2)\)-choosability of planar graphs with forbidden structures
- List point arboricity of graphs
- Ergodicity of the Wang–Swendsen–Kotecký algorithm on several classes of lattices on the torus
- Planar graphs without chordal 6-cycles are 4-choosable
- Some sufficient conditions for a planar graph of maximum degree six to be Class 1
- Separating signatures in signed planar graphs
- Cycle spectra of contraction-critically 4-connected planar graphs
- Light 3-paths in 3-polytopes without adjacent triangles
- DP-4-colorability of planar graphs without adjacent cycles of given length
- Minimal unavoidable sets of cycles in plane graphs with restricted minimum degree and edge weight
- On weak flexibility in planar graphs
- Planar graphs without 4-cycles adjacent to triangles are 4-choosable
- Find subtrees of specified weight and cycles of specified length in linear time
- Sufficient conditions for planar graphs without 4-cycles and 5-cycles to be 2-degenerate
- On planar graphs arbitrarily decomposable into closed trails
- A sufficient condition for DP-4-colorability
- Choosability in signed planar graphs
- On the sizes of graphs embeddable in surfaces of nonnegative Euler characteristic and their applications to edge choosability
- Vertex arboricity of planar graphs without chordal 6-cycles
- DP-4-colorability of two classes of planar graphs
- Planar graphs without intersecting 5-cycles are 4-choosable
- The 4-choosability of planar graphs and cycle adjacency
- List recoloring of planar graphs
- A sufficient condition for planar graphs to be DP-4-colorable
- Equitable list coloring of planar graphs without 4- and 6-cycles
- Planar graphs without normally adjacent short cycles
- Vertex 2-arboricity of planar graphs without 4-cycles adjacent to 6-cycles
- Planar graphs without 7-cycles and butterflies are DP-4-colorable
- On the structure of essentially-highly-connected polyhedral graphs
- Vertex arboricity of graphs embedded in a surface of non-negative Euler characteristic
- Vertex arboricity of planar graphs without intersecting 5-cycles
- Distribution of subtree sums
- A sufficient condition for a planar graph to be 4-choosable
- A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles
- Planar graphs without pairwise adjacent 3-, 4-, 5-, and 6-cycle are 4-choosable
- Planar graphs without mutually adjacent 3-, 5-, and 6-cycles are 3-degenerate
- 3‐Degenerate induced subgraph of a planar graph
- Planar graphs without specific cycles are 2-degenerate
This page was built for publication: Planar graphs without cycles of specific lengths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q697075)
