Path partitioning planar graphs with restrictions on short cycles

DOI10.33048/semi.2021.18.073zbMath1477.05141OpenAlexW3211789736MaRDI QIDQ2234425

Alekseĭ Nikolaevich Glebov

Publication date: 19 October 2021

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.33048/semi.2021.18.073

zbMATH Keywords

girthplanar graphpath partitionpath partition conjecture\( \tau \)-partitionable graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• The path partition conjecture is true for claw-free graphs
• Path partitioning planar graphs of girth 4 without adjacent short cycles
• Splitting a planar graph of girth 5 into two forests with trees of small diameter
• Path partitions and \(P_{n}\)-free sets
• Colouring planar graphs with bounded monochromatic components
• Path partitions of planar graphs
• A survey of the Path Partition Conjecture
• A Theorem on Planar Graphs
• On the number of cycles of lengthk in a maximal planar graph
• Partition problems and kernels of graphs
• A path(ological) partition problem
• Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths

This page was built for publication: Path partitioning planar graphs with restrictions on short cycles