On toughness and \((g,f)\)-factors in bipartite graphs (Q861483): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factors and factorizations of graphs—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4676513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4808027 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:14, 25 June 2024

scientific article
Language Label Description Also known as
English
On toughness and \((g,f)\)-factors in bipartite graphs
scientific article

    Statements

    On toughness and \((g,f)\)-factors in bipartite graphs (English)
    0 references
    0 references
    0 references
    29 January 2007
    0 references
    0 references
    isolated toughness
    0 references