The existence of \(P_{\geq3}\)-factor covered graphs (Q2409795): 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: Factors and factorizations of graphs. Proof techniques in factor theory / 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: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(K_{1,3}\)-factors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2811832 / 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: Sufficient condition for the existence of an even \([a,b]\)-factor in graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star-factors with large components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness and the existence of fractional \(k\)-factors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2765142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new neighborhood condition for graphs to be fractional \((k,m)\)-deleted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence number, connectivity and \((a,b,k)\)-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdigraphs with orthogonal factorizations of digraphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star-like factors with large components / 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

Latest revision as of 13:09, 14 July 2024

scientific article
Language Label Description Also known as
English
The existence of \(P_{\geq3}\)-factor covered graphs
scientific article

    Statements

    The existence of \(P_{\geq3}\)-factor covered graphs (English)
    0 references
    0 references
    0 references
    0 references
    13 October 2017
    0 references
    \(P_{\geq3}\)-factor
    0 references
    \(P_{\geq3}\)-factor covered graph
    0 references
    toughness
    0 references
    isolated toughness
    0 references
    regular graph.
    0 references

    Identifiers