On path-factor critical deleted (or covered) graphs (Q2156074): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Partitioning vertices of 1-tough graphs into paths / 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: Packing paths 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: Packing 3-vertex paths in claw-free graphs and related topics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path factors of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on path factors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results about component factors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on path-factor critical avoidable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path factors in subgraphs / 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: Isolated toughness and path-factor uniform graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sun toughness and $P_{\geq3}$-factors in graphs / rank
 
Normal rank

Latest revision as of 16:14, 29 July 2024

scientific article
Language Label Description Also known as
English
On path-factor critical deleted (or covered) graphs
scientific article

    Statements

    On path-factor critical deleted (or covered) graphs (English)
    0 references
    0 references
    0 references
    0 references
    15 July 2022
    0 references
    sun toughness
    0 references
    connectivity
    0 references
    \((P_{\geq 3},n)\)-factor critical deleted graph
    0 references
    \((P_{\geq 3},n)\)-factor critical covered graph
    0 references

    Identifiers

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