Local maximum stable set greedoids stemming from very well-covered graphs (Q444454): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / 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: 90C27 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6065749 / rank
 
Normal rank
Property / zbMATH Keywords
 
very well-covered graph
Property / zbMATH Keywords: very well-covered graph / rank
 
Normal rank
Property / zbMATH Keywords
 
local maximum stable set
Property / zbMATH Keywords: local maximum stable set / rank
 
Normal rank
Property / zbMATH Keywords
 
perfect matching
Property / zbMATH Keywords: perfect matching / rank
 
Normal rank
Property / zbMATH Keywords
 
greedoid
Property / zbMATH Keywords: greedoid / rank
 
Normal rank
Property / zbMATH Keywords
 
könig
Property / zbMATH Keywords: könig / rank
 
Normal rank
Property / zbMATH Keywords
 
Egerváry graph
Property / zbMATH Keywords: Egerváry graph / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q114858906 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1825447571 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1102.1142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of the Nemhauser and Trotter Theorem to Generalized Vertex Cover with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Greedoids / 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: Uniquely restricted matchings / 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: Q3928230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dependence graph for bases in matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4489216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2752151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new greedoid: The family of local maximum stable sets of a forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(\alpha^{+}\)-stable König-Egerváry graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(\alpha\)-critical edges in König--Egerváry graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5443167 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Clique Corona Operation and Greedoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3587708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph operations that are good for greedoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On local maximum stable set greedoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: VERY WELL-COVERED GRAPHS OF GIRTH AT LEAST FOUR AND LOCAL MAXIMUM STABLE SET GREEDOIDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / 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 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: 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:08, 5 July 2024

scientific article
Language Label Description Also known as
English
Local maximum stable set greedoids stemming from very well-covered graphs
scientific article

    Statements

    Local maximum stable set greedoids stemming from very well-covered graphs (English)
    0 references
    0 references
    0 references
    14 August 2012
    0 references
    very well-covered graph
    0 references
    local maximum stable set
    0 references
    perfect matching
    0 references
    greedoid
    0 references
    könig
    0 references
    Egerváry graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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