Topology of series-parallel networks
From MaRDI portal
Publication:2394739
Cites work
Cited in
(only showing first 100 items - show all)- Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
- On \(r\)-hued coloring of \(K_4\)-minor free graphs
- Perfect edge domination and efficient edge domination in graphs
- The Merino-Welsh conjecture holds for series-parallel graphs
- Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs
- The \(r\)-acyclic chromatic number of planar graphs
- A new graph parameter related to bounded rank positive semidefinite matrix completions
- Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
- Reduction algorithms for graphs of small treewidth
- The subgraph homeomorphism problem for small wheels
- Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs
- Tropical curves of hyperelliptic type
- Weak unit disk and interval representation of graphs
- Series parallel linkages
- On the stable set polytope of a series-parallel graph
- A Combinatorial Model for Series-Parallel Networks
- List point arboricity of graphs
- Strong equilibrium in network congestion games: increasing versus decreasing costs
- N-free posets as generalizations of series-parallel posets
- Parallel recognition and decomposition of two terminal series parallel graphs
- Series-parallel orientations preserving the cycle-radius
- Covering planar graphs with forests
- The entire coloring of series-parallel graphs
- Steiner trees and polyhedra
- Algorithms for core stability, core largeness, exactness, and extendability of flow games
- The real positive semidefinite completion problem for series-parallel graphs
- The regular matroids with no 5-wheel minor
- Inefficiencies in network models: a graph-theoretic perspective
- The Steiner tree polytope and related polyhedra
- Graph minors. XVI: Excluding a non-planar graph
- Collusion in atomic splittable routing games
- On \(r\)-acyclic edge colorings of planar graphs
- A homogenization result for planar, polygonal networks
- Proof theory for linear lattices
- The Tutte polynomial of a ported matroid
- Embeddings of circulant networks
- An approach to the subgraph homeomorphism problem
- On certain polytopes associated with graphs
- Structural conditions for cycle completable graphs
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Chromatic invariants for finite graphs: Theme and polynomial variations
- The Brown-Colbourn conjecture on zeros of reliability polynomials is false
- Approximating the distribution functions in stochastic networks
- Algorithms for recognition of regular properties and decomposition of recursive graph families
- Structure and recognition of graphs with no 6-wheel subdivision
- Nested Graphs
- Network topology and the efficiency of equilibrium
- On survivable network polyhedra
- Equistable distance-hereditary graphs
- Polytope des independants d'un graphe série-parallèle
- Equistable series-parallel graphs
- Parallel recognition of series-parallel graphs
- A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs
- Graphs with no 7-wheel subdivision
- Acyclic edge colorings of planar graphs and series parallel graphs
- The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\)
- A survey on interval routing
- Combinatorial algorithms on a class of graphs
- \(k\)-edge connected polyhedra on series-parallel graphs
- Analyse de sensibilité pour les problèmes linéaires en variables 0-1
- Distance Hereditary Graphs and the Interlace Polynomial
- Morphisms and currents in infinite nonlinear resistive networks
- A note on algebraic expressions of rhomboidal labeled graphs
- Web services composition: complexity and models
- Some results on the injective chromatic number of graphs
- On the unimodality of the independent set numbers of a class of matroids
- Complete monotonicity for inverse powers of some combinatorially defined polynomials
- Complexity of rainbow vertex connectivity problems for restricted graph classes
- Market equilibrium in multi‐tier supply chain networks
- Acyclic edge coloring of graphs with large girths
- Lower bounds for positive semidefinite zero forcing and their applications
- Hadwiger's conjecture
- Two-edge connected spanning subgraphs and polyhedra
- On series-parallel extensions of uniform matroids
- On spin models, triply regular association schemes, and duality
- The quadratic 0-1 knapsack problem with series-parallel support
- The search for chromatically unique graphs. II
- On the uniqueness of equilibrium in atomic splittable routing games
- Delta-wye reduction of almost-planar graphs
- Growth Rates and Critical Exponents of Classes of Binary Combinatorial Geometries
- Characterization and Recognition of Partial 3-Trees
- Colouring series-parallel graphs
- A solvable case of quadratic 0-1 programming
- Coloring the square of a \(K_{4}\)-minor free graph
- On graphs with no induced subdivision of \(K_4\)
- Strict neighbor-distinguishing index of \(K_4\)-minor-free graphs
- Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron
- Signature of power graphs
- Confluence up to garbage in graph transformation
- Arborescence polytopes for series-parallel graphs
- A note on the tour problems in two-terminal series-parallel graphs
- The box-TDI system associated with 2-edge connected spanning subgraphs
- Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph
- A compact labelling scheme for series-parallel graphs
- Efficient Farthest-Point Queries in Two-terminal Series-parallel Networks
- Box-total dual integrality and edge-connectivity
- On strict (outer-)confluent graphs
- Exact Learning of Finite Unions of Graph Patterns from Queries
- Denotational fixed-point semantics for constructive scheduling of synchronous concurrency
- Capacity-preserving subgraphs of directed flow networks
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)