LINEAR TIME RECOGNITION AND OPTIMIZATIONS FOR WEAK-BISPLIT GRAPHS, BI-COGRAPHS AND BIPARTITE P6-FREE GRAPHS

DOI10.1142/S0129054103001625MaRDI QIDQ5696896zbMATH OpenFDO

Authors Vassilis Giakoumakis, Jean-Marie Vanherpe

Publication date 19 October 2005

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054103001625

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Linear time recognition of weak bisplit graphs
• On canonical decomposition of bipartite graphs
• Some optimization problems on weak-bisplit graphs
• A note on the recognition of bisplit graphs
• Bipartite graphs totally decomposable by canonical decomposition

Cites work

• A Linear Recognition Algorithm for Cographs
• Bi-complement reducible graphs
• Classes of bipartite graphs related to chordal graphs
• Handle-rewriting hypergraph grammars
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Perfect Elimination and Chordal Bipartite Graphs
• The splittance of a graph

Cited in

(6)

• Some optimization problems on weak-bisplit graphs
• Fully dynamic recognition algorithm and certificate for directed cographs
• A note on the recognition of bisplit graphs
• Linear time recognition of weak bisplit graphs
• On bipartite graphs with weak density of some subgraphs
• A new characterization of \(P_{6}\)-free graphs

This page was built for publication: LINEAR TIME RECOGNITION AND OPTIMIZATIONS FOR WEAK-BISPLIT GRAPHS, BI-COGRAPHS AND BIPARTITE P₆-FREE GRAPHS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5696896)