Vertex- and edge-minimal and locally minimal graphs (Q1043552): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Created claim: DBLP publication ID (P1635): journals/dm/BorosG09, #quickstatements; #temporary_batch_1731505720702
 
(4 intermediate revisions by 4 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.1016/j.disc.2008.10.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2152893907 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59560578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A circular graph---counterexample to the Duchet kernel conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242951 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4094892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent problems and results about kernels in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphical properties related to minimal imperfection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect graphs are kernel solvable / rank
 
Normal rank
Property / cites work
 
Property / cites work: A corrected version of the Duchet kernel conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive generation of partitionable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing Berge graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong perfect graph theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphes Noyau-Parfaits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitiv orientierbare Graphen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / 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: Q5515142 / 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: Q5652708 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solutions of irreflexive relations / 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: Q2758341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs indecomposable with respect to the X-join / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/dm/BorosG09 / rank
 
Normal rank

Latest revision as of 14:59, 13 November 2024

scientific article
Language Label Description Also known as
English
Vertex- and edge-minimal and locally minimal graphs
scientific article

    Statements

    Vertex- and edge-minimal and locally minimal graphs (English)
    0 references
    0 references
    0 references
    9 December 2009
    0 references
    perfect and imperfect graphs
    0 references
    odd holes
    0 references
    odd anti-holes
    0 references
    chromatic number
    0 references
    clique number
    0 references
    complementary connected graphs
    0 references
    Rotterdam graphs
    0 references
    locally edge-minimal
    0 references
    locally vertex-minimal
    0 references
    kernel
    0 references

    Identifiers