scientific article; zbMATH DE number 7471106
From MaRDI portal
zbMath1482.05236arXiv1708.09686MaRDI QIDQ5026980
Marina Groshaus, Leandro Montero
Publication date: 8 February 2022
Full work available at URL: https://arxiv.org/abs/1708.09686
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On the hyperbolicity of bipartite graphs and intersection graphs
- Clique graphs of time graphs
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
- The complexity of clique graph recognition
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs
- The maximum edge biclique problem is NP-complete
- Distances and diameters on iterated clique graphs
- Bicliques and eigenvalues
- On edge perfectness and classes of bipartite graphs
- On bicliques and the second clique graph of suspensions
- Incidence matrices and interval graphs
- Biclique graph of bipartite permutation graphs
- A characterization of clique graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Über iterierte Clique-Graphen
- On Bipartite and Multipartite Clique Problems
- On iterated clique graphs with increasing diameters
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- Approximating Clique and Biclique Problems
- Topics in Intersection Graph Theory
- Graph Classes: A Survey
- Biclique graphs and biclique matrices
- A partial characterization of clique graphs
- Bicliques in graphs. I: Bounds on their number
