scientific article; zbMATH DE number 975383

zbMATH Open0862.05056MaRDI QIDQ5284057FDOQ5284057

Authors:

Publication date: 9 March 1997

Title of this publication is not available (Why is that?)

Recommendations

• Partitioning cographs into two forests and one independent set
• On the vertex partition of planar graphs into forests with bounded degree
• Partitioning sparse graphs into an independent set and a forest of bounded degree
• Partitions of some planar graphs into two linear forests
• Partitioning edges of a planar graph into linear forests and a matching
• Partitioning Planar Graphs
• Partitions of graphs by a method of independent subsets

zbMATH Keywords

chromatic numberNP-completeplanar graphsvertex arboricityvertex coloring

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cited In (4)

• Simple planar graph partition into three forests
• On the vertex partitions of sparse graphs into an independent vertex set and a forest with bounded maximum degree
• Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration
• On the vertex arboricity of planar graphs of diameter two

This page was built for publication:

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