Split clique graph complexity (Q393107): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
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: Luérbio Faria / rank
Normal rank
 
Property / author
 
Property / author: Celina M. Herrera de Figueiredo / 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 / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2013.07.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2040819829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique Graph Recognition Is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of clique graph recognition / 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: Self‐clique graphs and matrix permutations / 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: Complexity aspects of the Helly property: graphs and hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The P versus NP-complete dichotomy of some challenging problems in graph theory / 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: The clique operator on 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: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On clique-complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288086 / 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

Latest revision as of 06:30, 7 July 2024

scientific article
Language Label Description Also known as
English
Split clique graph complexity
scientific article

    Statements

    Split clique graph complexity (English)
    0 references
    0 references
    0 references
    0 references
    16 January 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    clique graph
    0 references
    Helly property
    0 references
    NP-completeness
    0 references
    split graphs
    0 references
    0 references