Cites work
Cited in
(only showing first 100 items - show all)- Chromaticity of series-parallel graphs
- The dominant of the 2-connected-Steiner-subgraph polytope for \(W_ 4\)-free graphs
- Graph theory in Coq: minors, treewidth, and isomorphisms
- Characterization and Recognition of Partial 3-Trees
- Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
- Multiterminal duality and three-terminal series-parallelness
- A graphical representation of relational formulae with complementation
- k-edge connected polyhedra on series-parallel graphs
- The \(r\)-acyclic chromatic number of planar graphs
- The anti-join composition and polyhedra
- Algorithms for core stability, core largeness, exactness, and extendability of flow games
- Necessary and sufficient conditions for a graph to be three-terminal series-parallel-cascade
- On graphs with no induced subdivision of \(K_4\)
- On series-parallel extensions of uniform matroids
- A linear-time certifying algorithm for recognizing generalized series-parallel graphs
- \#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method
- On-line algorithms for orders
- Resolving Braess's paradox in random networks
- Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited
- A polynomial time algorithm to compute the connected treewidth of a series-parallel graph
- Homomorphism bounds of signed bipartite \(K_4\)-minor-free graphs and edge-colorings of \(2k\)-regular \(K_4\)-minor-free multigraphs
- N-free posets as generalizations of series-parallel posets
- Parallel recognition and decomposition of two terminal series parallel graphs
- Structural conditions for cycle completable graphs
- Distance Hereditary Graphs and the Interlace Polynomial
- The Tutte polynomial of a ported matroid
- Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
- List point arboricity of graphs
- Minimum-maximal matching in series-parallel graphs
- Strict neighbor-distinguishing index of \(K_4\)-minor-free graphs
- Inefficiencies in network models: a graph-theoretic perspective
- Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs
- Minimal induced subgraphs of the class of 2-connected non-Hamiltonian wheel-free graphs
- Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron
- Concurrency and atomicity
- Treewidth-two graphs as a free algebra
- Handsome proof-nets: Perfect matchings and cographs
- On r-hued coloring of K₄-minor free graphs
- A polynomial-time algorithm for detecting the possibility of Braess paradox in directed graphs
- Acyclic edge coloring of graphs with large girths
- Series-parallel orientations preserving the cycle-radius
- Coloring cubic graphs by point-intransitive Steiner triple systems
- Proof theory for linear lattices
- Exact Learning of Finite Unions of Graph Patterns from Queries
- \(L(p,q)\)-labelling of \(K_{4}\)-minor free graphs
- On the unimodality of the independent set numbers of a class of matroids
- On strict (outer-)confluent graphs
- Determinacy in Linear Systems and Networks
- Series parallel linkages
- Lehman's theorem and the directed Steiner tree problem
- A homogenization result for planar, polygonal networks
- On the stable set polytope of a series-parallel graph
- Coloring the square of a \(K_{4}\)-minor free graph
- A Combinatorial Model for Series-Parallel Networks
- Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions
- On \(r\)-acyclic edge colorings of planar graphs
- On perfectly two-edge connected graphs
- Acyclic edge colorings of planar graphs and series parallel graphs
- A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs
- Describing the local structure of sequence graphs
- Combinatorial algorithms on a class of graphs
- Market equilibrium in multi‐tier supply chain networks
- A solvable case of quadratic 0-1 programming
- Cuts, matrix completions and graph rigidity
- Searching for an intruder on graphs and their subdivisions
- Algorithms for recognition of regular properties and decomposition of recursive graph families
- On the dominant of the Steiner 2-edge connected subgraph polytope
- Some results on the injective chromatic number of graphs
- Circuit and bond polytopes on series-parallel graphs
- Four problems on graphs with excluded minors
- Bipartite and series-parallel graphs without planar Lombardi drawings
- Denotational fixed-point semantics for constructive scheduling of synchronous concurrency
- Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- On certain polytopes associated with graphs
- Equistable series-parallel graphs
- Parametric computation of minimum-cost flows with piecewise quadratic costs
- Connected greedy colourings of perfect graphs and other classes: the good, the bad and the ugly
- The Concept of Two-Chord Tiesets and Its Application to an Algebraic Characterization of Non-Series-Parallel Graphs
- Parallel recognition of series-parallel graphs
- Substitutes and Complements in Constrained Linear Models
- Tropical curves of hyperelliptic type
- Chromatic invariants for finite graphs: Theme and polynomial variations
- On group choosability of total graphs
- Counting representable sets on simple graphs
- The box-TDI system associated with 2-edge connected spanning subgraphs
- Arborescence polytopes for series-parallel graphs
- Coherent orientations and series-parallel networks
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1
- Toughness and spanning trees in K4‐minor‐free graphs
- Colouring cubic graphs by small Steiner triple systems
- An approach to the subgraph homeomorphism problem
- A characterization of positroids, with applications to amalgams and excluded minors
- Approximating the distribution functions in stochastic networks
- The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\)
- scientific article; zbMATH DE number 7378361 (Why is no real title available?)
- Box-total dual integrality, box-integrality, and equimodular matrices
- The line index and minimum cut of weighted graphs
- Capacity-preserving subgraphs of directed flow networks
- Measuring the distance to series-parallelity by path expressions
This page was built for publication: Topology of series-parallel networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2394739)
