Path partitions of planar graphs
From MaRDI portal
Publication:2481195
zbMath1132.05315MaRDI QIDQ2481195
D. Zh. Zambalaeva, Alekseĭ Nikolaevich Glebov
Publication date: 14 April 2008
Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/53813
Related Items
Path partitioning planar graphs of girth 4 without adjacent short cycles ⋮ On 1-improper 2-coloring of sparse graphs ⋮ Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs ⋮ \((k,1)\)-coloring of sparse graphs ⋮ \((k,j)\)-coloring of sparse graphs ⋮ Defective 2-colorings of sparse graphs ⋮ (1,k)-Coloring of Graphs with Girth at Least Five on a Surface ⋮ Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1 ⋮ Path partitioning planar graphs with restrictions on short cycles ⋮ List strong linear 2-arboricity of sparse graphs ⋮ Splitting a planar graph of girth 5 into two forests with trees of small diameter ⋮ A Complexity Dichotomy for the Coloring of Sparse Graphs ⋮ Near-colorings: non-colorable graphs and NP-completeness ⋮ Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k ⋮ Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions ⋮ Partition of a planar graph with girth 6 into two forests with chain length at most 4 ⋮ Limits of Near-Coloring of Sparse Graphs
