scientific article; zbMATH DE number 1953106

MaRDI QIDQ4414510zbMATH OpenFDO

Authors Federica Ricca, Andrea Scozzari, Isabella Lari

Publication date 25 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2573/25730345.htm

zbMATH Keywords

Connected partitionMaximum Split ClusteringOuterplanar graphsSteiner Forest

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Edge covering pseudo-outerplanar graphs with forests
• Covering planar graphs with forests
• Obstructions for partitioning into forests and outerplanar graphs
• Covering a graph with a constrained forest (extended abstract)
• scientific article; zbMATH DE number 9665
• Covering planar graphs with forests, one having bounded maximum degree
• Covering planar graphs with forests, one having a bounded maximum degree
• scientific article; zbMATH DE number 4025463
• Covering a graph by forests and a matching
• Maximum induced linear forests in outerplanar graphs

Cited in

(1)

• Locating median paths on connected outerplanar graphs

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 Q4414510)