Well-dominated graphs without cycles of lengths 4 and 5 (Q2397523): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-Covered Vector Spaces of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The well-covered dimension of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of well-covered graphs with no cycles of length 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Greedy Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Structure When All Maximal Independent Sets Have Equal Weight / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3797234 / rank
 
Normal rank
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: A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for generating subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted well-covered claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-covered graphs without cycles of lengths 4, 5 and 6 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well covered simplicial, chordal, and circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for well‐covered graphs / rank
 
Normal rank

Latest revision as of 20:22, 13 July 2024

scientific article
Language Label Description Also known as
English
Well-dominated graphs without cycles of lengths 4 and 5
scientific article

    Statements

    Identifiers