Well-covered graphs without cycles of lengths 4, 5 and 6 (Q2345607): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The well-covered dimension of products of 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: Local Structure When All Maximal Independent Sets Have Equal Weight / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Greedy Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3139761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Very well covered graphs / 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: On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted well-covered graphs without \(C_{4}, C_{5}, C_{6}, C_{7}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On relating edges in graphs without cycles of length 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted well-covered 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: Well covered simplicial, chordal, and circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4179024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results for well‐covered graphs / 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 03:42, 10 July 2024

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

    Statements

    Well-covered graphs without cycles of lengths 4, 5 and 6 (English)
    0 references
    0 references
    0 references
    22 May 2015
    0 references
    well-covered graph
    0 references
    relating edge
    0 references
    generating subgraph
    0 references
    independent set
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references