Q5026980 (Q5026980): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The complexity of clique graph recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4722110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hyperbolicity of bipartite graphs and intersection graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Bipartite and Multipartite Clique Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über iterierte Clique-Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incidence matrices and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biclique graph of bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biclique graphs and biclique matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicliques and eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial characterization of clique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique graphs of time graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3786501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Clique and Biclique Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Intersection Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On edge perfectness and classes of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum edge biclique problem is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On iterated clique graphs with increasing diameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bicliques and the second clique graph of suspensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distances and diameters on iterated clique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicliques in graphs. I: Bounds on their number / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of clique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices / rank
 
Normal rank

Latest revision as of 22:48, 27 July 2024

scientific article; zbMATH DE number 7471106
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7471106

    Statements

    0 references
    0 references
    8 February 2022
    0 references
    maximal induced complete bipartite subgraph
    0 references
    forbidden structures
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references