Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors (Q2025161): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Minimum degree, independence number and pseudo \([2, b]\)-factors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \([k,k+1]\)-factor containing a given Hamiltonian cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree sum condition for the existence of spanning \(k\)-trees in star-free graphs / 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: Edge-connectivity and edges of even factors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs with prescribed valencies / 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: Degree conditions for Hamiltonian graphs to have \([a,b]\)-factors containing a given Hamiltonian cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4780524 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on Hamilton Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A degree condition implying ore-type condition for even \([2,b]\)-factors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Research on fractional critical covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A neighborhood union condition for fractional ID-\([a, b]\)-factor-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence number, connectivity and all fractional \((a, b, k)\)-critical 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: 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: Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs / 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: 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 18:07, 25 July 2024

scientific article
Language Label Description Also known as
English
Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors
scientific article

    Statements

    Degree conditions for \(k\)-Hamiltonian \([a,b]\)-factors (English)
    0 references
    0 references
    0 references
    11 May 2021
    0 references
    degree condition
    0 references
    \(k\)-Hamiltonian graph
    0 references
    \(k\)-Hamiltonian \([a,b]\)-factor
    0 references
    0 references

    Identifiers