Graph classes between parity and distance-hereditary graphs

DOI10.1016/S0166-218X(99)00075-XzbMath0933.05144OpenAlexW1990144643MaRDI QIDQ1302157

Serafino Cicerone, Gabriele Di Stefano

Publication date: 22 March 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00075-x

zbMATH Keywords

distance-hereditary graphgraph isomorphismrecognition algorithmsplit decompositionparity graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (10)

Networks with small stretch number ⋮ Split decomposition and graph-labelled trees: characterizations and fully dynamic algorithms for totally decomposable graphs ⋮ Efficient enumeration of non-isomorphic distance-hereditary graphs and related graphs ⋮ Practical and efficient split decomposition via graph-labelled trees ⋮ Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way ⋮ Equistable distance-hereditary graphs ⋮ Graphs with bounded induced distance ⋮ Distance-hereditary comparability graphs ⋮ (\(k,+\))-distance-hereditary graphs ⋮ Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs

This page was built for publication: Graph classes between parity and distance-hereditary graphs