Bi-complement reducible graphs

DOI10.1006/aama.1996.0519zbMath0872.05031MaRDI QIDQ1356114

Jean-Marie Vanherpe, Vassilis Giakoumakis

Publication date: 4 June 1997

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

Full work available at URL: https://doi.org/10.1006/aama.1996.0519

zbMATH Keywords

bi-cographs; bi-complement reducible graphs; complement reducible graphs

Mathematics Subject Classification ID

05C45: Eulerian and Hamiltonian graphs

Related Items

BIPARTITE GRAPHS TOTALLY DECOMPOSABLE BY CANONICAL DECOMPOSITION, LINEAR TIME RECOGNITION AND OPTIMIZATIONS FOR WEAK-BISPLIT GRAPHS, BI-COGRAPHS AND BIPARTITE P₆-FREE GRAPHS, On bipartite graphs with weak density of some subgraphs, Chordal bipartite graphs of bounded tree- and clique-width, On maximum induced matchings in bipartite graphs, Limits of structures and the example of tree semi-lattices, Between clique-width and linear clique-width of bipartite graphs, Investigating the \(b\)-chromatic number of bipartite graphs by using the bicomplement, Bipartite induced subgraphs and well-quasi-ordering, THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES, Forbidden induced bipartite graphs

Cites Work

• Complement reducible graphs
• Classes of bipartite graphs related to chordal graphs
• Linear time optimization algorithms for \(P_ 4\)-sparse graphs
• A Linear Recognition Algorithm for Cographs
• Operational Statistics. I. Basic Concepts
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item