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

DOI10.1142/S0129054103001625zbMath1099.68680MaRDI QIDQ5696896

Vassilis Giakoumakis, Jean-Marie Vanherpe

Publication date: 19 October 2005

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

Mathematics Subject Classification ID

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

Related Items (5)

On bipartite graphs with weak density of some subgraphs ⋮ Structural parameters for scheduling with assignment restrictions ⋮ A new characterization of \(P_{6}\)-free graphs ⋮ Fully dynamic recognition algorithm and certificate for directed cographs ⋮ Some optimization problems on weak-bisplit graphs

Cites Work

• Unnamed Item
• The splittance of a graph
• Classes of bipartite graphs related to chordal graphs
• Bi-complement reducible graphs
• Handle-rewriting hypergraph grammars
• A Linear Recognition Algorithm for Cographs
• Perfect Elimination and Chordal Bipartite Graphs

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