Bi-complement reducible graphs

DOI10.1006/aama.1996.0519zbMath0872.05031OpenAlexW2042657610MaRDI 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-cographsbi-complement reducible graphscomplement reducible graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Related Items (15)

The micro-world of cographs ⋮ On bipartite graphs with weak density of some subgraphs ⋮ Between clique-width and linear clique-width of bipartite graphs ⋮ Unnamed Item ⋮ Investigating the \(b\)-chromatic number of bipartite graphs by using the bicomplement ⋮ Structural parameters for scheduling with assignment restrictions ⋮ THE CLIQUE-WIDTH OF BIPARTITE GRAPHS IN MONOGENIC CLASSES ⋮ Regular partitions of gentle graphs ⋮ LINEAR TIME RECOGNITION AND OPTIMIZATIONS FOR WEAK-BISPLIT GRAPHS, BI-COGRAPHS AND BIPARTITE P₆-FREE GRAPHS ⋮ Bipartite induced subgraphs and well-quasi-ordering ⋮ Limits of structures and the example of tree semi-lattices ⋮ Forbidden induced bipartite graphs ⋮ Chordal bipartite graphs of bounded tree- and clique-width ⋮ BIPARTITE GRAPHS TOTALLY DECOMPOSABLE BY CANONICAL DECOMPOSITION ⋮ On maximum induced matchings in 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

This page was built for publication: Bi-complement reducible graphs