Best monotone degree conditions for graph properties: a survey
From MaRDI portal
(Redirected from Publication:489335)
Abstract: We survey sufficient degree conditions, for a variety of graph properties, that are best possible in the same sense that Chvatal's well-known degree condition for hamiltonicity is best possible.
Cites work
- scientific article; zbMATH DE number 3758373 (Why is no real title available?)
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- scientific article; zbMATH DE number 6277704 (Why is no real title available?)
- scientific article; zbMATH DE number 3257176 (Why is no real title available?)
- scientific article; zbMATH DE number 3293646 (Why is no real title available?)
- scientific article; zbMATH DE number 3297026 (Why is no real title available?)
- scientific article; zbMATH DE number 3353326 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- scientific article; zbMATH DE number 3186565 (Why is no real title available?)
- k -Factors and Neighbourhoods of Independent Sets in Graphs
- A Note on the Vertex Arboricity of a Graph
- A Short Proof of the Factor Theorem for Finite Graphs
- A method in graph theory
- A note on K-path hamiltonian graphs
- A simple proof of a theorem of Jung
- A sufficient condition for n ‐connectedness of graphs
- A sufficient condition for Hamiltonian circuits
- An inequality for the chromatic number of a graph
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
- Best monotone degree condition for 1-binding graphs to contain a 1-factor
- Best monotone degree conditions for binding number
- Best monotone degree conditions for binding number and cycle structure
- Binding number and toughness for matching extension
- Binding number, minimum degree, and cycle structure in graphs
- Computing the binding number of a graph
- Degree sequences and edge connectivity
- Degree sequences and the existence of \(k\)-factors
- Graphs \& digraphs
- Hamiltonian degree conditions for tough graphs
- Hamiltonian degree conditions which imply a graph is pancyclic
- Lower bounds on the stability number of graphs computed in terms of degrees
- Not every 2-tough graph is Hamiltonian
- On Hamilton's ideals
- On Maximal Circuits in Finite Graphs
- On n-Hamiltonian graphs
- Perfect matchings of a graph
- Recognizing tough graphs is NP-hard
- Some Theorems on Abstract Graphs
- Sufficient degree conditions for \(k\)-edge-connectedness of a graph
- The Eigenvalues of a Graph and Its Chromatic Number
- The Point-Arboricity of Planar Graphs
- The binding number of a graph and its Anderson number
- The binding number of a graph and its cliques
- The binding number of a graph and its pancyclism
- The strongest monotone degree condition for \(n\)-connectedness of a graph
- Tough graphs and Hamiltonian circuits.
- Toughness and binding number
- Toughness and vertex degrees
- Triangles and neighbourhoods of independent sets in graphs
- Vertex arboricity and vertex degrees
Cited in
(19)- Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor
- Wiener-type invariants on graph properties
- Extremal theorems for degree sequence packing and the two-color discrete tomography problem
- Reciprocal degree distance and graph properties
- A distributed low tree-depth decomposition algorithm for bounded expansion classes
- Wiener index, Harary index and graph properties
- Adjacency relationships forced by a degree sequence
- Stability theorems for graph vulnerability parameters
- Sufficient conditions for a graph to be \(k\)-edge-Hamiltonian, \(k\)-path-coverable, traceable and Hamilton-connected
- On sufficient conditions for Hamiltonicity of graphs, and beyond
- Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable
- Vertex arboricity and vertex degrees
- A degree sequence version of the Kühn-Osthus tiling theorem
- Best monotone degree conditions for binding number and cycle structure
- Spectral radius and \(k\)-connectedness of a graph
- Some sufficient conditions on \(k\)-connected graphs
- On the necessity of Chvátal's Hamiltonian degree condition
- Some topological indices and graph properties
- Spectral conditions for some graphical properties
This page was built for publication: Best monotone degree conditions for graph properties: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489335)
