Finding large planar subgraphs and large subgraphs of a given genus

DOI10.1007/3-540-61332-3_148zbMath1529.68197OpenAlexW1868436345MaRDI QIDQ6184659

Gruia Călinescu, Cristina G. Fernandes

Publication date: 29 January 2024

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61332-3_148

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Matching theory
• Graph theory applications
• The graph genus problem is NP-complete
• Arboricity and Subgraph Listing Algorithms

This page was built for publication: Finding large planar subgraphs and large subgraphs of a given genus