Well-covered triangulations. IV (Q323041): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C69 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C40 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6636286 / rank
 
Normal rank
Property / zbMATH Keywords
 
well-covered graph
Property / zbMATH Keywords: well-covered graph / rank
 
Normal rank
Property / zbMATH Keywords
 
maximal independent set
Property / zbMATH Keywords: maximal independent set / rank
 
Normal rank
Property / zbMATH Keywords
 
3-connected well-covered triangulation
Property / zbMATH Keywords: 3-connected well-covered triangulation / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2016.06.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2483716866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4693382 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4711490 / 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: 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 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: On well-covered triangulations. III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4243055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / 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: 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: 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
Property / cites work
 
Property / cites work: ModelingK-coteries by well-covered graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:14, 12 July 2024

scientific article
Language Label Description Also known as
English
Well-covered triangulations. IV
scientific article

    Statements

    Well-covered triangulations. IV (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 October 2016
    0 references
    well-covered graph
    0 references
    maximal independent set
    0 references
    3-connected well-covered triangulation
    0 references

    Identifiers

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