On the extension of bipartite to parity graphs

DOI10.1016/S0166-218X(99)00074-8zbMath0933.05132MaRDI QIDQ1302156

Gabriele Di Stefano, Serafino Cicerone

Publication date: 4 April 2000

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

zbMATH Keywords

distance-hereditary graphsbipartite graphssplit decompositionparity graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (8)

Grammars and clique-width bounds from split decompositions ⋮ A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion ⋮ Classes of perfect graphs ⋮ Practical and efficient split decomposition via graph-labelled trees ⋮ Using Split Composition to Extend Distance-Hereditary Graphs in a Generative Way ⋮ Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors ⋮ Solving some NP-complete problems using split decomposition ⋮ \(O(m\log n)\) split decomposition of strongly-connected graphs

This page was built for publication: On the extension of bipartite to parity graphs