A tight relation between series-parallel graphs and bipartite distance hereditary graphs

DOI10.26493/2590-9770.1396.3c7zbMath1502.05210arXiv1511.03100OpenAlexW3134695014WikidataQ113213292 ScholiaQ113213292MaRDI QIDQ5045248

Jean-François Mascari, Massimiliano Caramia, Paolo Giulio Franciosa, Nicola Apollonio

Publication date: 4 November 2022

Published in: The Art of Discrete and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1511.03100

zbMATH Keywords

binary matroidsseries-parallel graphsbipartite distance hereditary graphs

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Structural characterization of families of graphs (05C75)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Primal-dual approximation algorithms for integral flow and multicut in trees
• Tutte polynomials computable in polynomial time
• Domination, independent domination, and duality in strongly chordal graphs
• A characterization of circle graphs
• On the realization of double occurrence words
• Integrality properties of edge path tree families
• Distance-hereditary graphs
• Local complementation and interlacement graphs
• Graph minors. X: Obstructions to tree-decomposition
• On a characterization of Gauss codes
• On the excluded minors for the matroids of branch-width \(k\)
• Interlace polynomials
• A new proof of the Gauss interlace conjecture
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Finding edge-disjoint paths in partial \(k\)-trees
• On the Galois lattice of bipartite distance hereditary graphs
• On computing the Galois lattice of bipartite distance hereditary graphs
• Topology of series-parallel networks
• Enumeration and limit laws for series-parallel graphs
• Rank-width and vertex-minors
• The branchwidth of graphs and their cycle matroids
• Combinatorial Optimization
• On Integer Multiflow Maximization
• Series - parallel graphs and depth-first search trees
• Totally-Balanced and Greedy Matrices
• A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS
• Graph Classes: A Survey
• Distance Hereditary Graphs and the Interlace Polynomial
• A Combinatorial Model for Series-Parallel Networks
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• The edge-disjoint paths problem is NP-complete for series-parallel graphs

This page was built for publication: A tight relation between series-parallel graphs and bipartite distance hereditary graphs