Two Sufficient Conditions for Graphs to Admit Path Factors (Q6125708): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
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: Path and cycle factors of cubic bipartite graphs / 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: BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF <i>k</i>-FACTORS / 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: Degree conditions for the existence of a {<i>P</i><sub>2</sub>, <i>P</i><sub>5</sub>}-factor in a graph / 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 <i>k</i>-orthogonal factorizations in networks / 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: Path-factor critical covered graphs and path-factor uniform graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A neighborhood union condition for fractional \((a, b, k)\)-critical covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6160894 / 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 on path-factor critical avoidable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two sufficient conditions for odd \([1,b]\)-factors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isolated toughness and path-factor uniform graphs. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\mathcal{D}\)-index and \(\mathcal{Q}\)-index for spanning trees with leaf degree at most \(k\) in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some sufficient conditions for path-factor uniform graphs / 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: Independence number and connectivity for fractional (<i>a</i>, <i>b</i>, <i>k</i>)-critical covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The \(A_\alpha\)-spectral radius for path-factors in graphs / rank
 
Normal rank

Latest revision as of 09:15, 30 August 2024

scientific article; zbMATH DE number 7831250
Language Label Description Also known as
English
Two Sufficient Conditions for Graphs to Admit Path Factors
scientific article; zbMATH DE number 7831250

    Statements

    Two Sufficient Conditions for Graphs to Admit Path Factors (English)
    0 references
    0 references
    0 references
    11 April 2024
    0 references
    graph
    0 references
    degree condition
    0 references
    \( \mathcal{P}_{\geq 3}\)-factor
    0 references
    \(( \mathcal{P}_{\geq 3},m)\)-factor deleted graph
    0 references
    \(( \mathcal{P}_{\geq 3},k)\)-factor critical graph
    0 references
    0 references

    Identifiers