Erdős-Gyárfás conjecture for \(P_8\)-free graphs (Q2084789): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q123114416, #quickstatements; #temporary_batch_1710346988437
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W4304080595 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2109.01277 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-Colorable Subclasses of $P_8$-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4329122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some old and new problems in various branches of combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős-Gyárfás conjecture for some families of Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4988791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Erdős-Gyárfás conjecture for cubic planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Erdős-Gyárfás conjecture in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4489163 / rank
 
Normal rank

Latest revision as of 10:00, 30 July 2024

scientific article
Language Label Description Also known as
English
Erdős-Gyárfás conjecture for \(P_8\)-free graphs
scientific article

    Statements

    Erdős-Gyárfás conjecture for \(P_8\)-free graphs (English)
    0 references
    0 references
    0 references
    13 October 2022
    0 references
    Erdős-Gyárfás conjecture
    0 references
    \(P_8\)-free graph
    0 references
    cycle
    0 references

    Identifiers

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