Biclique graphs of interval bigraphs
From MaRDI portal
Publication:2184675
DOI10.1016/J.DAM.2020.02.010zbMATH Open1440.05132OpenAlexW3007185222MaRDI QIDQ2184675FDOQ2184675
J. P. Puppo, Marina Groshaus, André L. P. Guedes, E. P. Cruz
Publication date: 29 May 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2020.02.010
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- ILIGRA: an efficient inverse line graph algorithm
- Graph Classes: A Survey
- Computing roots of graphs is hard
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- Complexity of finding graph roots with girth conditions
- Self‐clique graphs and matrix permutations
- Algorithms for Square Roots of Graphs
- A Characterization of Comparability Graphs and of Interval Graphs
- Bipartite permutation graphs
- Recognizing clique graphs of directed and rooted path graphs
- Biclique graphs and biclique matrices
- Clique graphs of time graphs
- Interval bigraphs and circular arc graphs
- The clique operator on circular-arc graphs
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- Recognizing interval digraphs and interval bigraphs in polynomial time
- The number of convergent graphs under the biclique operator with no twin vertices is finite
- On the Iterated Biclique Operator
- Bicliques and eigenvalues
- Almost every graph is divergent under the biclique operator
- On clique divergent graphs with linear growth
- Biclique graph of bipartite permutation graphs
Cited In (4)
Uses Software
This page was built for publication: Biclique graphs of interval bigraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2184675)
