Best monotone degree conditions for graph properties: a survey (Q489335): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Douglas Bauer / rank
Normal rank
 
Property / author
 
Property / author: Hajo J. Broersma / rank
Normal rank
 
Property / author
 
Property / author: Jan van den Heuvel / rank
Normal rank
 
Property / author
 
Property / author: Nathan Kahl / 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: Hajo J. Broersma / rank
 
Normal rank
Property / author
 
Property / author: Jan van den Heuvel / rank
 
Normal rank
Property / author
 
Property / author: Nathan Kahl / 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 / OpenAlex ID
 
Property / OpenAlex ID: W2046857096 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1405.5760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings of a graph / 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: Not every 2-tough graph is Hamiltonian / 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: Recognizing tough graphs is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5405465 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Toughness and binding number / 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: A simple proof of a theorem of Jung / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2971216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex arboricity and vertex degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best monotone degree conditions for binding number and cycle structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian degree conditions which imply a graph is pancyclic / 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: Q5668821 / 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: Q5580168 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for <i>n</i> ‐connectedness of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Point-Arboricity of Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3065457 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binding number and toughness for matching extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamilton's ideals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tough graphs and Hamiltonian circuits. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the binding number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on the Vertex Arboricity of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian degree conditions for tough graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Maximal Circuits in Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF <i>k</i>-FACTORS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree sequences and edge connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on K-path hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On n-Hamiltonian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The binding number of a graph and its cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the stability number of graphs computed in terms of degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5628162 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5722819 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangles and neighbourhoods of independent sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The binding number of a graph and its pancyclism / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inequality for the chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Short Proof of the Factor Theorem for Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound for the chromatic number of a graph and its application to timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Eigenvalues of a Graph and Its Chromatic Number / 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
Property / cites work
 
Property / cites work: <i>k</i> -Factors and Neighbourhoods of Independent Sets in Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Revision as of 12:34, 9 July 2024

scientific article
Language Label Description Also known as
English
Best monotone degree conditions for graph properties: a survey
scientific article

    Statements

    Best monotone degree conditions for graph properties: a survey (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 January 2015
    0 references
    best monotone degree conditions
    0 references
    Hamiltonicity
    0 references
    connectivity
    0 references
    toughness
    0 references
    \(k\)-factor
    0 references
    binding number
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers