Minimum degree conditions for \(H\)-linked graphs (Q947099): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Vertex-disjoint cycles containing specified edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Onk-ordered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances on the Hamiltonian problem -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Sufficient Degree Conditions for a Graph to be $k$-linked / rank
 
Normal rank
Property / cites work
 
Property / cites work: Onk-ordered Hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extremal problem for <i>H</i>‐linked graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: k-ordered Hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved linear edge bound for graph linkages / rank
 
Normal rank

Latest revision as of 17:48, 28 June 2024

scientific article
Language Label Description Also known as
English
Minimum degree conditions for \(H\)-linked graphs
scientific article

    Statements

    Minimum degree conditions for \(H\)-linked graphs (English)
    0 references
    0 references
    0 references
    29 September 2008
    0 references
    0 references
    extremal graph problems
    0 references
    degree conditions
    0 references
    \(H\)-linked graphs
    0 references
    0 references