Topology of series-parallel networks

Cites Work

A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
Nonlinear networks. IIa
Title not available (Why is that?)
Non-linear network problems

Cited In (only showing first 100 items - show all)

\(k\)-edge connected polyhedra on series-parallel graphs
The \(r\)-acyclic chromatic number of planar graphs
Algorithms for core stability, core largeness, exactness, and extendability of flow games
Distance Hereditary Graphs and the Interlace Polynomial
On series-parallel extensions of uniform matroids
On graphs with no induced subdivision of \(K_4\)
Efficient Algorithms for Optimization and Selection on Series-Parallel Graphs
N-free posets as generalizations of series-parallel posets
The Tutte polynomial of a ported matroid
Inefficiencies in network models: a graph-theoretic perspective
Acyclic edge coloring of graphs with large girths
On \(r\)-hued coloring of \(K_4\)-minor free graphs
Series-parallel orientations preserving the cycle-radius
Proof theory for linear lattices
On the Uniqueness of Equilibrium in Atomic Splittable Routing Games
On the unimodality of the independent set numbers of a class of matroids
A Combinatorial Model for Series-Parallel Networks
Series parallel linkages
On the stable set polytope of a series-parallel graph
A homogenization result for planar, polygonal networks
Weak Unit Disk and Interval Representation of Graphs
Market equilibrium in multi‐tier supply chain networks
Coloring the square of a \(K_{4}\)-minor free graph
On \(r\)-acyclic edge colorings of planar graphs
A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs
Acyclic edge colorings of planar graphs and series parallel graphs
Combinatorial algorithms on a class of graphs
A solvable case of quadratic 0-1 programming
Algorithms for recognition of regular properties and decomposition of recursive graph families
Some results on the injective chromatic number of graphs
On certain polytopes associated with graphs
Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
Equistable series-parallel graphs
Hadwiger’s Conjecture
Parallel recognition of series-parallel graphs
Tropical curves of hyperelliptic type
Chromatic invariants for finite graphs: Theme and polynomial variations
Analyse de sensibilité pour les problèmes linéaires en variables 0-1
LIST POINT ARBORICITY OF GRAPHS
An approach to the subgraph homeomorphism problem
Approximating the distribution functions in stochastic networks
The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\)
Strong equilibrium in network congestion games: increasing versus decreasing costs
The Steiner tree polytope and related polyhedra
Network topology and the efficiency of equilibrium
Polytope des independants d'un graphe série-parallèle
A note on algebraic expressions of rhomboidal labeled graphs
The real positive semidefinite completion problem for series-parallel graphs
Equistable distance-hereditary graphs
The entire coloring of series-parallel graphs
A survey on interval routing
Delta-wye reduction of almost-planar graphs
The Merino-Welsh conjecture holds for series-parallel graphs
Linear Bound in Terms of Maxmaxflow for the Chromatic Roots of Series-Parallel Graphs
Steiner trees and polyhedra
On spin models, triply regular association schemes, and duality
Structure and recognition of graphs with no 6-wheel subdivision
Complete monotonicity for inverse powers of some combinatorially defined polynomials
The subgraph homeomorphism problem for small wheels
The Brown-Colbourn conjecture on zeros of reliability polynomials is false
Graphs with no 7-wheel subdivision
Perfect edge domination and efficient edge domination in graphs
Covering planar graphs with forests
Embeddings of circulant networks
Nested Graphs
Web services composition: complexity and models
Complexity of rainbow vertex connectivity problems for restricted graph classes
Braess's paradox for flows over time
The quadratic 0-1 knapsack problem with series-parallel support
Reduction algorithms for graphs of small treewidth
Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs
Morphisms and currents in infinite nonlinear resistive networks
Lower bounds for positive semidefinite zero forcing and their applications
Two-edge connected spanning subgraphs and polyhedra
Growth Rates and Critical Exponents of Classes of Binary Combinatorial Geometries
Colouring series-parallel graphs
The regular matroids with no 5-wheel minor
Graph minors. XVI: Excluding a non-planar graph
The search for chromatically unique graphs. II
A new graph parameter related to bounded rank positive semidefinite matrix completions
On survivable network polyhedra
Collusion in atomic splittable routing games
Characterization and Recognition of Partial 3-Trees
Minimum-cost strong network orientation problems: Classification, complexity, and algorithms
Signature of power graphs
On some complexity properties of N-free posets and posets with bounded decomposition diameter
Network Resilience
Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph
A compact labelling scheme for series-parallel graphs
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
A graphical representation of relational formulae with complementation
Multiterminal duality and three-terminal series-parallelness
Exact or approximate inference in graphical models: why the choice is dictated by the treewidth, and how variable elimination can be exploited
The anti-join composition and polyhedra
Necessary and sufficient conditions for a graph to be three-terminal series-parallel-cascade
A linear-time certifying algorithm for recognizing generalized series-parallel graphs
\#P-completeness of counting update digraphs, cacti, and series-parallel decomposition method
Resolving Braess's paradox in random 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)