The clique operator on circular-arc graphs (Q987670): 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: Jayme Luiz Szwarcfiter / rank
Normal rank
 
Property / author
 
Property / author: Jayme Luiz Szwarcfiter / 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.dam.2009.01.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2060969780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial characterization of clique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of clique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407448 / 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 graphs of time 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: The clique operator on graphs with few \(P_{4}\)'s / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über iterierte Clique-Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dismantlings and iterated clique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability in circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of clique divergent graphs with linear growth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient graph representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certifying Algorithms for Recognizing Proper Circular-Arc Graphs and Unit Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simpler Linear-Time Recognition of Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proper Helly Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations and recognition of circular-arc graphs and subclasses: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time recognition of circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5461444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-clique Helly circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for clique-independent sets on subclasses of circular-arc 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: Q4940014 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit Circular-Arc Graph Representations and Feasible Circulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On expansive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of iterated clique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-to-vertex pursuit in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing quasi-triangulated graphs. / rank
 
Normal rank

Latest revision as of 02:46, 3 July 2024

scientific article
Language Label Description Also known as
English
The clique operator on circular-arc graphs
scientific article

    Statements

    The clique operator on circular-arc graphs (English)
    0 references
    0 references
    0 references
    0 references
    13 August 2010
    0 references
    0 references
    algorithms
    0 references
    clique graphs
    0 references
    Helly circular-arc graphs
    0 references
    \(K\)-behavior
    0 references
    proper Helly circular-arc graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references