Maximum induced linear forests in outerplanar graphs
From MaRDI portal
Publication:1889849
DOI10.1007/s00373-003-0528-xzbMath1060.05028MaRDI QIDQ1889849
Publication date: 13 December 2004
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-003-0528-x
05C35: Extremal problems in graph theory
05C10: Planar graphs; geometric and topological aspects of graph theory
Related Items
Maximum induced forests in graphs of bounded treewidth, On the induced matching problem, A lower bound on the order of the largest induced linear forest in triangle-free planar graphs, SEFE without Mapping via Large Induced Outerplane Graphs in Plane Graphs, Feedback vertex number of Sierpiński-type graphs