Biclique graphs of split graphs
From MaRDI portal
Publication:2091808
Recommendations
Cites work
- scientific article; zbMATH DE number 1107738 (Why is no real title available?)
- scientific article; zbMATH DE number 1944140 (Why is no real title available?)
- scientific article; zbMATH DE number 2188345 (Why is no real title available?)
- A characterization of clique graphs
- A convexity upper bound for the number of maximal bicliques of a bipartite graph
- A partial characterization of clique graphs
- Almost every graph is divergent under the biclique operator
- Biclique graphs and biclique matrices
- Biclique graphs of interval bigraphs
- Biclique-Helly graphs
- Clique Graph Recognition Is NP-Complete
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs
- Minimum proper interval graphs
- On clique divergent graphs with linear growth
- On clique-complete graphs
- On star and biclique edge-colorings
- On the hyperbolicity of bipartite graphs and intersection graphs
- On the iterated biclique operator
- On the iterated edge-biclique operator
- Self‐clique graphs and matrix permutations
- The Transitive Reduction of a Directed Graph
- The clique operator on circular-arc graphs
- The number of convergent graphs under the biclique operator with no twin vertices is finite
Cited in
(7)- Biclique graphs of interval bigraphs
- Biclique graph of bipartite permutation graphs
- On some conjectures on biclique graphs
- Finding biclique partitions of co-chordal graphs
- Disjoint clique cutsets in graphs without long holes
- Biclique graphs of interval containment gigraphs
- scientific article; zbMATH DE number 1750103 (Why is no real title available?)
This page was built for publication: Biclique graphs of split graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2091808)