Partitioning sparse plane graphs into two induced subgraphs of small degree

zbMath1299.05261MaRDI QIDQ2454534

Anna O. Ivanova, Oleg V. Borodin

Publication date: 13 June 2014

Published in: Sibirskie Èlektronnye 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) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Partition of a planar graph with girth 6 into two forests with chain length at most 4

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