Path partitioning planar graphs of girth 4 without adjacent short cycles

zbMath1398.05070MaRDI QIDQ1615735

Alekseĭ Nikolaevich Glebov, D. Zh. Zambalaeva

Publication date: 31 October 2018

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

zbMATH Keywords

girthtriangle-free graphplanar 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)

Related Items (1)

Path partitioning planar graphs with restrictions on short cycles

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
• Splitting a planar graph of girth 5 into two forests with trees of small diameter
• Path partitions and \(P_{n}\)-free sets
• 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
• Partition of a planar graph with girth 6 into two forests with chain length at most 4

This page was built for publication: Path partitioning planar graphs of girth 4 without adjacent short cycles