Some results on path-factor critical avoidable graphs (Q2107757): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Si-zhong Zhou / rank
Normal rank
 
Property / author
 
Property / author: Si-zhong Zhou / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.7151/dmgt.2364 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3092050107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1-factor covers of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions for the existence of a path‐factor which are related to odd components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness and the existence ofk-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A toughness condition for fractional \((k, m)\)-deleted graphs revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4604362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A necessary and sufficient condition for the existence of a path factor every component of which is a path of length at least two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Component factors with large components in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness of graphs and the existence of factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing 3-vertex paths in claw-free graphs and related topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of Tutte's 1-factor theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research on fractional critical covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2765142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on orthogonal factorizations of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on path factors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5065860 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some existence theorems on path factors with given properties in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A toughness condition for fractional \((k,m)\)-deleted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree conditions for fractional \((a,b,k)\)-critical covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs with orthogonal factorizations in graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:38, 30 July 2024

scientific article
Language Label Description Also known as
English
Some results on path-factor critical avoidable graphs
scientific article

    Statements

    Some results on path-factor critical avoidable graphs (English)
    0 references
    2 December 2022
    0 references
    toughness
    0 references
    isolated toughness
    0 references
    \(P_{\geq k}\)-factor
    0 references
    \((P_{ \geq k}, n)\)-factor critical avoidable graph
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references