On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs (Q1012442): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3836/tjm/1233844061 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968243230 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On factors of 4-connected claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Hamiltonian circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden subgraphs that imply 2-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonicity in 3-connected claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian results inK1,3-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A degree condition for the existence of regular factors inK1,n-free graphs / rank
 
Normal rank

Latest revision as of 12:34, 1 July 2024

scientific article
Language Label Description Also known as
English
On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs
scientific article

    Statements

    On \(2\)-factors in \(r\)-connected \(\{K_{1,k},P_4\}\)-free graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    21 April 2009
    0 references
    2-factor
    0 references
    forbidden subgraph
    0 references
    minimum degree
    0 references

    Identifiers