Connected (g, f)-factors (Q2778283): 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: Connected \([k,k+1]\)-factors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness of graphs and \([2,b]\)-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness, trees, and walks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flows and generalized coloring theorems in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness of graphs and the existence of factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian ?-factors in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a connection between the existence of k-trees and the toughness of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Ore-type conditions for the existence of connected \([2,k]\)-factors in graphs / rank
 
Normal rank

Latest revision as of 22:47, 3 June 2024

scientific article
Language Label Description Also known as
English
Connected (g, f)-factors
scientific article

    Statements

    Identifiers