Not complementary connected and not CIS \(d\)-graphs form weakly monotone families (Q966046): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Vladimir A. Gurvich / rank
Normal rank
 
Property / author
 
Property / author: Vladimir A. Gurvich / 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.disc.2009.11.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2136818182 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59560562 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs whose maximal cliques and stable sets intersect / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex- and edge-minimal and locally minimal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal and locally minimal games and game forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3614023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lambda composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4075490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4120519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3666625 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3741636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing complete edge-chromatic graphs and hypergraphs. Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge colorings of complete graphs without tricolored triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal hypergraphs and the perfect graph conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular decomposition and transitive orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental modular decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a property of the class of n-colorable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs indecomposable with respect to the X-join / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization of Almost CIS Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of Grillet's theorem on maximal stable sets and maximal cliques in graphs / rank
 
Normal rank

Latest revision as of 19:18, 2 July 2024

scientific article
Language Label Description Also known as
English
Not complementary connected and not CIS \(d\)-graphs form weakly monotone families
scientific article

    Statements

    Not complementary connected and not CIS \(d\)-graphs form weakly monotone families (English)
    0 references
    0 references
    0 references
    0 references
    27 April 2010
    0 references
    0 references
    \(d\)-graph
    0 references
    complementary connected
    0 references
    Gallai
    0 references
    weakly monotone
    0 references
    minimal and locally minimal
    0 references
    0 references
    0 references