Schematic Representation of Biconnected Graphs
From MaRDI portal
Publication:5014113
DOI10.1007/978-3-030-68766-3_13OpenAlexW3130855811MaRDI QIDQ5014113FDOQ5014113
Authors: Giuseppe Di Battista, Fabrizio Frati, Maurizio Patrignani, Marco Tais
Publication date: 1 December 2021
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-68766-3_13
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Characterizations of outerplanar graphs
- Title not available (Why is that?)
- The book thickness of a graph
- Linear algorithms to recognize outerplanar and maximal outerplanar graphs
- Title not available (Why is that?)
- One-Page Book Embedding under Vertex-Neighborhood Constraints
- Networks
- Schematic representation of large biconnected graphs
Cited In (1)
This page was built for publication: Schematic Representation of Biconnected Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014113)