On well-covered triangulations. III (Q972324): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q55877988, #quickstatements; #temporary_batch_1712111774907
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Triangles with restricted degree sum of their boundary vertices in plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On well-covered triangulations. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On well-covered triangulations. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4243055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangles with restricted degrees of their boundary vertices in plane triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal independent sets of vertices in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some covering concepts in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: WELL-COVERED GRAPHS: A SURVEY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for well‐covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-covered claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of well-covered graphs and the complexity of their recognition problems / rank
 
Normal rank

Latest revision as of 21:16, 2 July 2024

scientific article
Language Label Description Also known as
English
On well-covered triangulations. III
scientific article

    Statements

    On well-covered triangulations. III (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    25 May 2010
    0 references
    0 references
    well-covered graph
    0 references
    maximal independent set
    0 references
    4-connected planar triangulation
    0 references
    0 references
    0 references