Forbidden restrictions and the existence of \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor (Q6099108): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3910557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness condition for a graph to be all fractional (g,f,n)-critical deleted / rank
 
Normal rank
Property / cites work
 
Property / cites work: The extension degree conditions for fractional factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isolated toughness for path factors in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On path-factor critical deleted (or covered) graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: TOUGHNESS, ISOLATED TOUGHNESS AND PATH FACTORS 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: Path factors and neighborhoods of independent sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(P_{\geq 3}\)-factor deleted graphs / 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: Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness and the existence ofk-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2765142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2744319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The binding number of a graph and its Anderson number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The existence of \(P_{\geq3}\)-factor covered graphs / rank
 
Normal rank

Latest revision as of 10:13, 1 August 2024

scientific article; zbMATH DE number 7697700
Language Label Description Also known as
English
Forbidden restrictions and the existence of \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor
scientific article; zbMATH DE number 7697700

    Statements

    Forbidden restrictions and the existence of \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    19 June 2023
    0 references
    network graphs
    0 references
    factor-deleted graph
    0 references

    Identifiers