On bipartite graphs with weak density of some subgraphs
From MaRDI portal
Publication:878650
DOI10.1016/J.DISC.2005.11.089zbMATH Open1115.68113OpenAlexW2086110710MaRDI QIDQ878650FDOQ878650
Authors: Jean-Luc Fouquet, Jean-Marie Vanherpe 
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
Recommendations
- On some weakly bipartite graphs
- scientific article; zbMATH DE number 1187139
- A characterization of weakly bipartite graphs
- A characterization of weakly bipartite graphs
- On Subgraphs of the Complete Bipartite Graph
- Bipartite subgraphs of integer weighted graphs
- Weakly bipancyclic bipartite graphs
- Bipartite density of triangle-free subcubic graphs
- On the bipartite density of regular graphs with large girth
- On the density of subgraphs in a graph with bounded independence number
Cites Work
- Title not available (Why is that?)
- Complement reducible graphs
- On extended \(P_4\)-reducible and extended \(P_4\)-sparse graphs
- Title not available (Why is that?)
- A Linear Recognition Algorithm for Cographs
- Classes of bipartite graphs related to chordal graphs
- P4-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
- Recognizing $P_4 $-Sparse Graphs in Linear Time
- A linear-time recognition algorithm for \(P_{4}\)-reducible graphs
- Matroids arisen from matrogenic graphs
- Title not available (Why is that?)
- Bi-complement reducible graphs
- Title not available (Why is that?)
- Bipartite graphs totally decomposable by canonical decomposition
- LINEAR TIME RECOGNITION AND OPTIMIZATIONS FOR WEAK-BISPLIT GRAPHS, BI-COGRAPHS AND BIPARTITE P6-FREE GRAPHS
Cited In (4)
This page was built for publication: On bipartite graphs with weak density of some subgraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q878650)
