Best monotone degree conditions for binding number and cycle structure (Q496429): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Douglas Bauer / rank
Normal rank
 
Property / author
 
Property / author: A. Nevo / rank
Normal rank
 
Property / author
 
Property / author: Edward F. Schmeichel / rank
Normal rank
 
Property / author
 
Property / author: Douglas R. Woodall / rank
Normal rank
 
Property / author
 
Property / author: Douglas Bauer / rank
 
Normal rank
Property / author
 
Property / author: Edward F. Schmeichel / rank
 
Normal rank
Property / author
 
Property / author: Douglas R. Woodall / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2013.12.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2045073432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree sequences and the existence of \(k\)-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness and Vertex Degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient degree conditions for<i>k</i>-edge-connectedness of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best monotone degree conditions for binding number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binding Number, Minimum Degree, and Cycle Structure in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strongest monotone degree condition for \(n\)-connectedness of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5576241 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamilton's ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5722819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The binding number of a graph and its Anderson number / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for Hamiltonian circuits / rank
 
Normal rank

Latest revision as of 19:45, 10 July 2024

scientific article
Language Label Description Also known as
English
Best monotone degree conditions for binding number and cycle structure
scientific article

    Statements

    Best monotone degree conditions for binding number and cycle structure (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    21 September 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    toughness
    0 references
    binding number
    0 references
    cycle structure
    0 references
    degree sequence
    0 references
    best monotone
    0 references
    0 references