On factors of 4-connected claw-free graphs (Q2744573): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Eulerian and Hamiltonian Graphs and Line Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2713641 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds of the number of disjoint spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian results inK1,3-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a closure concept in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reflections on graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hamiltonian line graphs and connectivity / rank
 
Normal rank

Latest revision as of 20:09, 3 June 2024

scientific article
Language Label Description Also known as
English
On factors of 4-connected claw-free graphs
scientific article

    Statements

    On factors of 4-connected claw-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 December 2001
    0 references
    0 references
    0 references
    0 references
    0 references
    claw-free graph
    0 references
    line graph
    0 references
    Hamilton cycle
    0 references
    Hamilton path
    0 references
    factor
    0 references
    0 references