On bipartite graphs with weak density of some subgraphs

DOI10.1016/j.disc.2005.11.089zbMath1115.68113OpenAlexW2086110710MaRDI QIDQ878650

Jean-Marie Vanherpe, Jean-Luc Fouquet

Publication date: 26 April 2007

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

Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.089

zbMATH Keywords

sparse graphsbipartite graphs decomposition

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• A linear-time recognition algorithm for \(P_{4}\)-reducible graphs
• Complement reducible graphs
• Classes of bipartite graphs related to chordal graphs
• Bi-complement reducible graphs
• Matroids arisen from matrogenic graphs
• On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs
• P₄-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
• A Linear Recognition Algorithm for Cographs
• Recognizing $P_4 $-Sparse Graphs in Linear Time
• BIPARTITE GRAPHS TOTALLY DECOMPOSABLE BY CANONICAL DECOMPOSITION
• LINEAR TIME RECOGNITION AND OPTIMIZATIONS FOR WEAK-BISPLIT GRAPHS, BI-COGRAPHS AND BIPARTITE P₆-FREE GRAPHS
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On bipartite graphs with weak density of some subgraphs