Intersection graph of maximal stars (Q2197473): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Clique-critical graphs: maximum size and recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of clique graph recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3428631 / 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: Almost every graph is divergent under the biclique operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Iterated Biclique Operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Star and Biclique Coloring and Choosability Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biclique graphs and biclique matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of substar graphs / 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: On the iterated edge-biclique operator / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical graph isomorphism. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient reconstruction of a graph from its line graph in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of clique graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1911.10515 / rank
 
Normal rank

Latest revision as of 09:35, 23 July 2024

scientific article
Language Label Description Also known as
English
Intersection graph of maximal stars
scientific article

    Statements

    Intersection graph of maximal stars (English)
    0 references
    31 August 2020
    0 references
    intersection graphs
    0 references
    stars
    0 references
    star graphs
    0 references
    cliques
    0 references
    edge clique covers
    0 references
    0 references
    0 references

    Identifiers