The complexity of clique graph recognition (Q1019185): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2009.01.018 / rank
Normal rank
 
Property / author
 
Property / author: Liliana Alcón / rank
 
Normal rank
Property / author
 
Property / author: Luérbio Faria / rank
 
Normal rank
Property / author
 
Property / author: Celina M. Herrera de Figueiredo / rank
 
Normal rank
Property / author
 
Property / author: Marisa Gutierrez / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086520272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4810363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cliques and extended triangles. A necessary condition for planar clique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique Graph Recognition Is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-critical graphs: maximum size and recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4722110 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self‐clique graphs and matrix permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clique convergent graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dually Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über iterierte Clique-Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clique-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dismantlings and iterated clique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5708502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3839009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection graphs and the clique operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial characterization of clique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The clique operator on cographs and serial graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph relations, clique divergence and surface triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hereditary clique-Helly self-clique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques of Helly Circular-arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topics in Intersection Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clique divergent graphs with linear growth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221403 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clique-complete graphs / 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: Convergence of iterated clique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A common generalization of line graphs and clique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4867717 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing clique graphs of directed and rooted path graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-inverse graphs ofK3-free andK4-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of clique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique Graphs of Chordal and Path Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407448 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2009.01.018 / rank
 
Normal rank

Latest revision as of 13:11, 10 December 2024

scientific article
Language Label Description Also known as
English
The complexity of clique graph recognition
scientific article

    Statements

    The complexity of clique graph recognition (English)
    0 references
    28 May 2009
    0 references
    clique graphs
    0 references
    NP-complete problems
    0 references
    Helly property
    0 references
    intersection graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers