Acyclic subgraphs with high chromatic number (Q1621059): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q129349024, #quickstatements; #temporary_batch_1728777301724
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1811.05734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oriented trees in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic number of random graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3900086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sets of Acquaintances and Strangers at any Party / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zur algebraischen Begründung der Graphentheorie. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nombre chromatique et plus longs chemins d'un graphe / rank
 
Normal rank
Property / cites work
 
Property / cites work: Totally odd \(K_4\)-subdivisions in 4-chromatic graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129349024 / rank
 
Normal rank

Latest revision as of 01:03, 13 October 2024

scientific article
Language Label Description Also known as
English
Acyclic subgraphs with high chromatic number
scientific article

    Statements

    Acyclic subgraphs with high chromatic number (English)
    0 references
    0 references
    0 references
    15 November 2018
    0 references
    4-chromatic graph
    0 references
    3-chromatic acyclic subgraph
    0 references

    Identifiers