Mondshein Sequences (a.k.a. (2,1)-Orders)
From MaRDI portal
Publication:2832896
DOI10.1137/15M1030030zbMath1350.05082OpenAlexW2963593775MaRDI QIDQ2832896
Publication date: 15 November 2016
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/15m1030030
independent spanning treesgraph drawingcanonical ordering(2,1)-orderMonshein sequencenonseperating ear decomposition
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (3)
Simple computation of \textit{st}-edge- and \textit{st}-numberings from ear decompositions ⋮ Edge-orders ⋮ Quantitative Restrictions on Crossing Patterns
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Certifying algorithms
- Certifying 3-edge-connectivity
- How to draw a planar graph on a grid
- Maintaining order in a generalized linked list
- On the complexity of partitioning graphs into connected subgraphs
- A linear-time algorithm for a special case of disjoint set union
- The multi-tree approach to reliability in distributed networks
- Partition conditions and vertex-connectivity of graphs
- Output-sensitive reporting of disjoint paths
- Independent trees in planar graphs
- Drawing planar graphs using the canonical ordering
- Contractions, Removals, and Certifying 3-Connectivity in Linear Time
- A Planarity Test via Construction Sequences
- Construction Sequences and Certifying 3-Connectedness
- More Canonical Ordering
- A Linear-Time Algorithm for Finding a Maximal Planar Subgraph
- Three tree-paths
- Dynamic orthogonal segment intersection search
- Finding nonseparating induced cycles and independent spanning trees in 3-connected graphs
- Kuratowski's theorem
- A homology theory for spanning tress of a graph
- Lectures on Polytopes
- Non-Separable and Planar Graphs
- Orderly Spanning Trees with Applications
- Finding Four Independent Trees
- How to Draw a Graph
- The (3,1)-ordering for 4-connected planar triangulations
This page was built for publication: Mondshein Sequences (a.k.a. (2,1)-Orders)
