On Halin subgraphs and supergraphs

DOI10.1016/0166-218X(93)E0131-HzbMath0815.68073OpenAlexW1992378780MaRDI QIDQ1343152

R. Gary Parker, Steven B. Horton

Publication date: 1 February 1995

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(93)e0131-h

zbMATH Keywords

Halin graphsHalin subgraphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (1)

Intersections and circuits in sets of line segments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for recognition of regular properties and decomposition of recursive graph families
• Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
• An Application of Duality to Edge-Deletion Problems
• Edge-Deletion Problems
• Node-Deletion Problems on Bipartite Graphs
• Ear Decompositions of Elementary Graphs and GF2-rank of Perfect Matchings
• Deterministic Dcomposition of Recursive Graph Classes
• On a Family of Planar Bicritical Graphs
• Halin graphs and the travelling salesman problem
• Node-and edge-deletion NP-complete problems
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs

This page was built for publication: On Halin subgraphs and supergraphs