Path partitioning planar graphs with restrictions on short cycles

DOI10.33048/SEMI.2021.18.073MaRDI QIDQ2234425zbMATH OpenOpenAlexFDO

Authors A. N. Glebov

Publication date 19 October 2021

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

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

zbMATH Keywords

\( \tau \)-partitionable graphgirthpath partitionpath partition conjectureplanar graph

Mathematics Subject Classification ID

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

Recommendations

• Path partitioning planar graphs of girth 4 without adjacent short cycles
• Path partitions of planar graphs
• Path partition of planar graphs with girth at least six
• Partitioning sparse plane graphs into two induced subgraphs of small degree
• Path partitionable graphs

Cites work

• A path(ological) partition problem
• A survey of the path partition conjecture
• A Theorem on Planar Graphs
• Colouring planar graphs with bounded monochromatic components
• scientific article; zbMATH DE number 4010565 (Why is no real title available?)
• scientific article; zbMATH DE number 1416470 (Why is no real title available?)
• Improper coloring of sparse graphs with a given girth. I: \((0,1)\)-colorings of triangle-free graphs
• On 1-improper 2-coloring of sparse graphs
• On the number of cycles of lengthk in a maximal planar graph
• Partition problems and kernels of graphs
• Path partitioning planar graphs of girth 4 without adjacent short cycles
• Path partitions and \(P_{n}\)-free sets
• Path partitions of planar graphs
• Splitting a planar graph of girth 5 into two forests with trees of small diameter
• Splitting planar graphs of girth 6 into two linear forests with short paths
• The path partition conjecture is true for claw-free graphs

Cited in

(6)

• Path partitioning planar graphs of girth 4 without adjacent short cycles
• Partitioning graphs into paths or cycles of prescribed lengths
• Path partitions of planar graphs
• Cycle partition of two-connected and two-edge connected graphs
• Path partitionable graphs
• On a cycle partition problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2234425)