Induced maximal outerplane subgraph conjecture
Induced maximal outerplane subgraph conjecture
Let be a plane graph of sufficiently large order . The outerplane subgraph number is the maximum order of an induced outerplane subgraph of .
Induced maximal outerplane subgraph conjecture.
The construction in the paper gives examples with an induced maximal outerplane subgraph of order at most ; the supplied text does not state a resolution of this conjecture.
Sources & referencesView supporting material
Primary source
Kengo Enami, Naoki Matsumoto and Takamasa Yashima, “Contributions to conjectures on planar graphs: Induced Subgraphs, Treewidth, and Dominating Sets”, arXiv:2506.10471 (2025).
Additional references
2 papers in this index state this conjecture (2017–2025). The statement above is taken from the most recent of them; the others are arXiv:1711.00212.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.