The competition number of a graph with exactly two holes (Q434196): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The competition number of a graph having exactly one hole / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rigid circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5752597 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRAPHS WITH ONE HOLE AND COMPETITION NUMBER ONE / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competition numbers of graphs with a small number of triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: The competition number of a graph with exactly \(h\) holes, all of which are independent / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computation of the Competition Number of a Graph / rank
 
Normal rank

Revision as of 10:22, 5 July 2024

scientific article
Language Label Description Also known as
English
The competition number of a graph with exactly two holes
scientific article

    Statements

    The competition number of a graph with exactly two holes (English)
    0 references
    0 references
    0 references
    10 July 2012
    0 references
    competition graph
    0 references
    competition number
    0 references
    chordal graph
    0 references
    chordless cycle
    0 references
    hole
    0 references

    Identifiers