A degree condition for fractional \([a,b]\)-covered graphs (Q1711417): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood-union condition for an \([a, b]\)-factor avoiding a specified Hamiltonian cycle / 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: Q4731216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A degree condition for a graph to have \((a,b)\)-parity factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ore-type conditions for the existence of even \([2,b]\)-factors in graphs / 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: Q2804751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on orthogonal factorizations of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On all fractional \({(a,b,k)}\)-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood conditions for fractional ID-\(k\)-factor-critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A result on \(r\)-orthogonal factorizations in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some existence theorems on all fractional \((g,f)\)-factors with prescribed properties / rank
 
Normal rank

Latest revision as of 21:33, 17 July 2024

scientific article
Language Label Description Also known as
English
A degree condition for fractional \([a,b]\)-covered graphs
scientific article

    Statements

    Identifiers