On Halin subgraphs and supergraphs
From MaRDI portal
(Redirected from On Halin subgraphs and supergraphs)
Recommendations
Cites work
- A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
- Algorithms for recognition of regular properties and decomposition of recursive graph families
- An Application of Duality to Edge-Deletion Problems
- Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families
- Deterministic Dcomposition of Recursive Graph Classes
- Ear Decompositions of Elementary Graphs and GF2-rank of Perfect Matchings
- Edge-Deletion Problems
- Halin graphs and the travelling salesman problem
- scientific article; zbMATH DE number 432820 (Why is no real title available?)
- scientific article; zbMATH DE number 4095510 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3346402 (Why is no real title available?)
- Node-and edge-deletion NP-complete problems
- Node-Deletion Problems on Bipartite Graphs
- On a Family of Planar Bicritical Graphs
Cited in
(4)
This page was built for publication: On Halin subgraphs and supergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1343152)