WELL-COVERED GRAPHS: A SURVEY (Q4288045): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56210383, #quickstatements; #temporary_batch_1707149277123
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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.1080/16073606.1993.9631737 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2014871086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularisable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Greedy Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Well-covered graphs and extendability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence numbers of graphs - an extension of the Koenig-Egervary theorem / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in polytopal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on <i>k</i>-Saturated Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 4-connected claw-free well-covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching-perfect and cover-perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ear-decompositions of matching-covered graphs / 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: Q5528475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some covering concepts in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic coloration of 3-polytopes / 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: On some subclasses of well-covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the graphs in which the transversal number equals the matching number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4014306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:43, 22 May 2024

scientific article; zbMATH DE number 553876
Language Label Description Also known as
English
WELL-COVERED GRAPHS: A SURVEY
scientific article; zbMATH DE number 553876

    Statements

    WELL-COVERED GRAPHS: A SURVEY (English)
    0 references
    0 references
    21 April 1994
    0 references
    maximal independent set
    0 references
    greedy algorithm
    0 references
    independence number
    0 references
    well- covered graphs
    0 references

    Identifiers