Interior graphs of maximal outerplane graphs

DOI10.1016/0095-8956(85)90081-4zbMath0566.05025OpenAlexW1964300527MaRDI QIDQ1059083

Andrzej Proskurowski, Sandra M. Hedetniemi, Maciej M. Sysło

Publication date: 1985

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(85)90081-4

zbMATH Keywords

interior graphmaximal outerplane graphplane embedding

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (5)

Rainbow subgraphs in edge-colored planar and outerplanar graphs ⋮ A connected version of the graph coloring game ⋮ Conservative trees ⋮ MAXIMAL OUTERPLANE GRAPHS WITH TWO SIMPLICIAL VERTICES ⋮ Worm colorings

Cites Work

• Separating subgraphs in k-trees: Cables and caterpillars
• Minimum dominating cycles in outerplanar graphs
• Trees with Hamiltonian square
• Properties and characterizations of k ‐trees
• Unnamed Item

This page was built for publication: Interior graphs of maximal outerplane graphs