Biclique graphs of split graphs
From MaRDI portal
Publication:2091808
DOI10.1016/j.dam.2021.12.028zbMath1502.05106OpenAlexW4210459496MaRDI QIDQ2091808
J. P. Puppo, Marina Groshaus, André L. P. Guedes
Publication date: 2 November 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2021.12.028
Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the hyperbolicity of bipartite graphs and intersection graphs
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs
- Almost every graph is divergent under the biclique operator
- The clique operator on circular-arc graphs
- On clique divergent graphs with linear growth
- On clique-complete graphs
- Minimum proper interval graphs
- On the iterated edge-biclique operator
- Biclique graphs of interval bigraphs
- A convexity upper bound for the number of maximal bicliques of a bipartite graph
- Biclique-Helly graphs
- A characterization of clique graphs
- The number of convergent graphs under the biclique operator with no twin vertices is finite
- On star and biclique edge-colorings
- Clique Graph Recognition Is NP-Complete
- Self‐clique graphs and matrix permutations
- On the Iterated Biclique Operator
- Biclique graphs and biclique matrices
- A partial characterization of clique graphs
- The Transitive Reduction of a Directed Graph
This page was built for publication: Biclique graphs of split graphs