Altitude of regular graphs with girth at least five (Q1781975): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Problems and results in extremal combinatorics. I. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A monotone path in an edge-ordered graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4659594 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing sequences with nonzero block sums and increasing paths in edge-ordered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350166 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Combinatorial Theorems on Monotonicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3318806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Increasing paths in edge ordered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions and reductions of snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223159 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone paths in edge-ordered sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large monotone paths in graphs with bounded degree / rank
 
Normal rank

Latest revision as of 12:18, 10 June 2024

scientific article
Language Label Description Also known as
English
Altitude of regular graphs with girth at least five
scientific article

    Statements

    Altitude of regular graphs with girth at least five (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    10 June 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    Edge ordering
    0 references
    Increasing paths
    0 references
    Monotone paths
    0 references
    Snarks
    0 references
    0 references