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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 7 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10878-010-9331-9 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6053934 / rank
 
Normal rank
Property / zbMATH Keywords
 
competition graph
Property / zbMATH Keywords: competition graph / rank
 
Normal rank
Property / zbMATH Keywords
 
competition number
Property / zbMATH Keywords: competition number / rank
 
Normal rank
Property / zbMATH Keywords
 
chordal graph
Property / zbMATH Keywords: chordal graph / rank
 
Normal rank
Property / zbMATH Keywords
 
chordless cycle
Property / zbMATH Keywords: chordless cycle / rank
 
Normal rank
Property / zbMATH Keywords
 
hole
Property / zbMATH Keywords: hole / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2139042312 / rank
 
Normal rank
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
Property / DOI
 
Property / DOI: 10.1007/S10878-010-9331-9 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:31, 9 December 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