Computing sharp 2-factors in claw-free graphs (Q988693): 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.1016/j.jda.2009.07.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3032434623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp upper bounds on the minimum number of components of 2-factors in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closure concepts for claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular factors in <i>K</i><sub>1,3</sub>‐free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular factors in <i>K</i><sub>1,<i>n</i></sub> free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 2-factors in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Claw-free graphs---a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On traceability and 2-factors in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4243804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-factors with few cycles in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even subgraphs of bridgeless graphs and 2-factors of line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian results inK1,3-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph factors and factorization: 1985--2003: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G / 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: Q4700525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of components in 2-factors of claw-free graphs / rank
 
Normal rank

Latest revision as of 03:03, 3 July 2024

scientific article
Language Label Description Also known as
English
Computing sharp 2-factors in claw-free graphs
scientific article

    Statements

    Computing sharp 2-factors in claw-free graphs (English)
    0 references
    0 references
    0 references
    18 August 2010
    0 references
    0 references
    claw-free graph
    0 references
    2-factor
    0 references
    number of components
    0 references
    polynomial algorithm
    0 references
    0 references