Partitioning sparse plane graphs into two induced subgraphs of small degree

MaRDI QIDQ2454534zbMATH OpenFDO

Authors Oleg V. Borodin, Anna O. Ivanova

Publication date 13 June 2014

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

Full work available at URL http://semr.math.nsc.ru/v6/p13-16.pdf

zbMATH Keywords

planar graphcoloringvertex partition

Mathematics Subject Classification ID

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

Recommendations

• Path partitions of planar graphs
• scientific article; zbMATH DE number 6125173
• Path partition of planar graphs with girth at least six
• Partitioning sparse graphs into an independent set and a graph with bounded size components
• Partition of a planar graph with girth 6 into two forests with chain length at most 4

Cited in

(8)

• Path partition of planar graphs with girth at least six
• Partition of a planar graph with girth 7 into two star forests
• Path partitioning planar graphs with restrictions on short cycles
• Plane triangulations are 6-partitionable
• Path partitions of planar graphs
• Partitioning planar graphs with girth at least 6 into bounded size components
• Partition of a planar graph with girth 6 into two forests with chain length at most 4
• Partitioning sparse graphs into an independent set and a graph with bounded size components

This page was built for publication: Partitioning sparse plane graphs into two induced subgraphs of small degree

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