Dividing a Graph into Triconnected Components
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Drawing plane graphs nicely
- Edge-packing planar graphs by cyclic graphs
- Projective plan and Möbius band obstructions
- On the bond polytope
- Trémaux trees and planarity
- scientific article; zbMATH DE number 7765396 (Why is no real title available?)
- Pathlength of outerplanar graphs
- Rectilinear-upward planarity testing of digraphs
- A linear-time algorithm for testing outer-1-planarity
- Detecting cycles through three fixed vertices in a graph
- The st-planar edge completion problem is fixed-parameter tractable
- Shortest beer path queries based on graph decomposition
- Edge-contraction problems
- Recognition of DFS trees: Sequential and parallel algorithms with refined verifications
- The anti-join composition and polyhedra
- Locating facilities which interact: Some solvable cases
- A more compact visibility representation
- On graphs with no induced subdivision of \(K_4\)
- -list vertex coloring in linear time
- The input/output complexity of transitive closure
- A decomposition algorithm for multi-terminal network flows
- A decomposition algorithm for network reliability evaluation
- Balanced cycles and holes in bipartite graphs
- Blocks in \(k\)-connected graphs
- Optimization and Recognition for K 5-minor Free Graphs in Linear Time
- 4-edge-coloring graphs of maximum degree 3 in linear time
- Reachability in \(K_{3,3}\)-free and \(K_5\)-free graphs is in unambiguous logspace
- Computing the 4-edge-connected components of a graph: an experimental study
- A minimum 3-connectivity augmentation of a graph
- A linear algorithm for the all-bidirectional-edges problem on planar graphs
- A plane graph representation of triconnected graphs
- A linear algorithm for the domination number of a series-parallel graph
- An extension of the multi-path algorithm for finding Hamilton cycles
- Data structures for node connectivity queries
- Parameterized graph cleaning problems
- Finding strong components using depth-first search
- Decomposition of 3-connected graphs
- The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs
- Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time
- Crossing number and weighted crossing number of near-planar graphs
- Improved algorithms for graph four-connectivity
- Computing Circuit Polynomials in the Algebraic Rigidity Matroid
- Finding large cycles in Hamiltonian graphs
- Balanced group-labeled graphs
- Fast incremental planarity testing
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
- Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge
- Kernelization of Whitney Switches
- Enumerating combinatorial resultant trees
- Rigid tensegrity labelings of graphs
- An annotated review on graph drawing and its applications
- Faster approximation algorithms for weighted triconnectivity augmentation problems
- A linear delay algorithm in SD set system and its application to subgraph enumeration
- Safe separators for treewidth
- Tractable minor-free generalization of planar zero-field Ising models
- Acyclic k-connected subgraphs for distributed alternate routing in communications networks
- Counting labelled three-connected and homeomorphically irreducible two- connected graphs
- Structure and enumeration of two-connected graphs with prescribed three-connected components
- Re-embedding a 1-plane graph for a straight-line drawing in linear time
- Decomposition by clique separators
- Globally rigid circuits of the direction-length rigidity matroid
- Near-optimal distributed computation of small vertex cuts
- A linear algorithm for embedding planar graphs using PQ-trees
- The arborescence-realization problem
- On the secure domination numbers of maximal outerplanar graphs
- A linear time algorithm for computing 3-edge-connected components in a multigraph
- On the NP-hardness of edge-deletion and -contraction problems
- A linear-time algorithm for finding an ambitus
- Graph connectivity, partial words, and a theorem of Fine and Wilf
- Minor-Closed Graph Classes with Bounded Layered Pathwidth
- Maintaining triconnected components under node expansion
- Path-based depth-first search for strong and biconnected components
- Fully dynamic 2-edge-connectivity in planar graphs
- Extending planar graph algorithms to \(K_{3,3}\)-free graphs
- Binary constraint satisfaction problems defined by excluded topological minors
- Generating 3-vertex connected spanning subgraphs
- Computing orthogonal drawings with the minimum number of bends
- The bottleneck 2-connected k-Steiner network problem for k 2
- Some tractable win-lose games
- Minimum cost star-shaped drawings of plane graphs with a fixed embedding and concave corner constraints
- VERTEX DECOMPOSITION TO CALCULATE THE NETWORK PROBABILISTIC CONNECTIVITY
- Pathlength of outerplanar graphs
- Undirected vertex-connectivity structure and smallest four-vertex-connectivity augmentation (extended abstract)
- Generalized flowers in \(k\)-connected graphs
- The decomposition of graphs into \(k\)-connected components
- A more accurate view of the flat wall theorem
- DFS tree construction: Algorithms and characterizations
- A note on finding the bridges of a graph
- Finding 2-edge and 2-vertex strongly connected components in quadratic time
- Canonical decompositions of symmetric submodular systems
- Uncovering generalized-network structure in matrices
- An approach to the subgraph homeomorphism problem
- Depth-first search is inherently sequential
- Linear time parameterized algorithms for subset feedback vertex set
- Non-planar core reduction of graphs
- Decremental SPQR-trees for Planar Graphs
- A topological approach to dynamic graph connectivity
- Recognising k-connected hypergraphs in cubic time
- A smallest augmentation to 3-connect a graph
- The exact overall time distribution of a project with uncertain task durations
This page was built for publication: Dividing a Graph into Triconnected Components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4767335)
