The Clique Corona Operation and Greedoids (Q5505676): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Vadim E. Levit / rank
Normal rank
 
Property / author
 
Property / author: Eugen Mandrescu / rank
Normal rank
 
Property / author
 
Property / author: Vadim E. Levit / rank
 
Normal rank
Property / author
 
Property / author: Eugen Mandrescu / 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.1007/978-3-540-85097-7_36 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2125057284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Greedoids / 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: On 4-connected claw-free well-covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4489216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949856 / 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: Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings / 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: 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 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
Property / cites work
 
Property / cites work: Q4014306 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:54, 28 June 2024

scientific article; zbMATH DE number 5498473
Language Label Description Also known as
English
The Clique Corona Operation and Greedoids
scientific article; zbMATH DE number 5498473

    Statements

    The Clique Corona Operation and Greedoids (English)
    0 references
    27 January 2009
    0 references
    0 references
    0 references

    Identifiers