Path factors in subgraphs (Q2161249): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3910557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path factors in claw-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning vertices of 1-tough graphs into paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The existence of a path-factor without small odd paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight independent set neighborhood union condition for fractional critical deleted graphs and ID deleted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path factors and parallel knock-out schemes of almost claw-free 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: 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 and \(f\)-factors of 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: Path factors in cubic 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: A degree condition for fractional \((g, f, n)\)-critical covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \([a,b]\)-factors of graphs on surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binding numbers and connected factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binding number conditions for matching extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of orthogonal factorizations in digraphs / 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: Research on fractional critical covered graphs / 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: Characterizations for \({\mathcal{P}}_{\geq 2}\)-factor and \({\mathcal{P}}_{\geq 3}\)-factor covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binding numbers and restricted fractional \(( g , f )\)-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: Remarks on path factors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on fractional ID-\( [ a , b ]\)-factor-critical covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5065860 / 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: A sufficient condition for the existence of restricted fractional \((g, f)\)-factors in 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

Latest revision as of 19:27, 29 July 2024

scientific article
Language Label Description Also known as
English
Path factors in subgraphs
scientific article

    Statements

    Path factors in subgraphs (English)
    0 references
    0 references
    0 references
    0 references
    4 August 2022
    0 references
    binding number
    0 references
    \(P_{\geq 2}\)-faktor
    0 references
    \(P_{\geq 3}\)-faktor
    0 references
    \( ( P_{\geq 2}, n )\)-critical deleted graph
    0 references
    \( ( P_{\geq 3}, n )\)-critical deleted graph
    0 references
    0 references
    0 references

    Identifiers