Sufficient condition for the existence of an even \([a,b]\)-factor in graph (Q354444): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Factors and factorizations of graphs—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: The stability number and connected \([k,k+1]\)-factor in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503098 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability number and [<i>a,b</i>]‐factors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability number and even \([2,b]\)-factors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405642 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even [a,b]-factors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected factors in graphs -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs with prescribed valencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees with bounded degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence number, connectivity, and r‐factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph factors and factorization: 1985--2003: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence number, connectivity and \((a,b,k)\)-critical graphs / rank
 
Normal rank

Latest revision as of 16:13, 6 July 2024

scientific article
Language Label Description Also known as
English
Sufficient condition for the existence of an even \([a,b]\)-factor in graph
scientific article

    Statements

    Identifiers