On 2-factors with a bounded number of odd components (Q2439124): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2014.01.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2109396373 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q114190737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factors and factorizations of graphs. Proof techniques in factor theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The existence of a 2-factor in K1, n-free graphs with large connectivity and large edge-connectivity / 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: Regular factors in <i>K</i><sub>1,<i>n</i></sub> free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Forbidden subgraphs that imply 2-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Pair of Forbidden Subgraphs and 2-Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Updating the hamiltonian problem—A survey / 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: Forbidden subgraphs and Hamiltonian properties and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double covers of cubic graphs with oddness 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorizations of regular graphs of high degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The NP-Completeness of Edge-Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the perfect matchings of near regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cycle-double covers of graphs of small oddness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Five cycle double covers of some cubic 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: On edge-disjoint pairs of matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On disjoint matchings in cubic 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: Closure, 2-factors, and cycle coverings in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3916595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral decompositions of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of components in 2-factors of claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorizations of regular graphs / rank
 
Normal rank

Latest revision as of 11:15, 7 July 2024

scientific article
Language Label Description Also known as
English
On 2-factors with a bounded number of odd components
scientific article

    Statements

    On 2-factors with a bounded number of odd components (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 March 2014
    0 references
    0 references
    2-factor
    0 references
    claw-free
    0 references
    closure
    0 references
    disjoint 1-factors
    0 references
    0 references
    0 references
    0 references