On the well-coveredness of Cartesian products of graphs (Q998514): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A characterization of well covered graphs of girth 5 or greater / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some covering concepts in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for well‐covered 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
Property / cites work
 
Property / cites work: Q4014306 / rank
 
Normal rank

Latest revision as of 01:09, 29 June 2024

scientific article
Language Label Description Also known as
English
On the well-coveredness of Cartesian products of graphs
scientific article

    Statements

    On the well-coveredness of Cartesian products of graphs (English)
    0 references
    28 January 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    well-covered
    0 references
    Cartesian products
    0 references
    independent sets
    0 references
    0 references