scientific article; zbMATH DE number 3565019
From MaRDI portal
Publication:4137202
zbMath0363.05031MaRDI QIDQ4137202
Publication date: 1976
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (34)
Acyclically 4-colorable triangulations ⋮ Construction of acyclically 4-colourable planar triangulations with minimum degree 4 ⋮ A \(13k\)-kernel for planar feedback vertex set via region decomposition ⋮ A lower bound on the order of the largest induced forest in planar graphs with high girth ⋮ Coloring parameters for graphs on surfaces ⋮ Partial DP-coloring of graphs ⋮ Robust Connectivity of Graphs on Surfaces ⋮ Maximum induced forests in graphs of bounded treewidth ⋮ An (F1,F4)‐partition of graphs with low genus and girth at least 6 ⋮ 3‐Degenerate induced subgraph of a planar graph ⋮ The k‐path vertex cover: General bounds and chordal graphs ⋮ On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree ⋮ Partitioning planar graphs without 4-cycles and 5-cycles into two forests with a specific condition ⋮ A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles ⋮ Large induced forests in planar graphs with girth 4 ⋮ Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests ⋮ A lower bound on the order of the largest induced linear forest in triangle-free planar graphs ⋮ Degenerate and star colorings of graphs on surfaces ⋮ Acyclic 5-choosability of planar graphs without 4-cycles ⋮ Maximum 4-degenerate subgraph of a planar graph ⋮ Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles ⋮ Large induced forests in triangle-free planar graphs ⋮ Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles ⋮ Acyclic 4-choosability of planar graphs without adjacent short cycles ⋮ Equitable partition of planar graphs ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ Minimum size of feedback vertex sets of planar graphs of girth at least five ⋮ On the vertex partition of planar graphs into forests with bounded degree ⋮ Solution of problems of Kotzig and Grünbaum concerning the isolation of cycles in planar graphs ⋮ On acyclically 4-colorable maximal planar graphs ⋮ Feedback vertex sets in (directed) graphs of bounded degeneracy or treewidth ⋮ An \((F_3,F_5)\)-partition of planar graphs with girth at least 5 ⋮ A Conjecture of Borodin and a Coloring of Grünbaum ⋮ Partitioning planar graphs without 4-cycles and 6-cycles into a linear forest and a forest
This page was built for publication:
