Best monotone degree conditions for graph properties: a survey
From MaRDI portal
Publication:489335
DOI10.1007/s00373-014-1465-6zbMath1306.05032arXiv1405.5760OpenAlexW2046857096MaRDI QIDQ489335
M. Yatauro, A. Nevo, Nathan Kahl, Hajo J. Broersma, Douglas Bauer, Jan van den Heuvel, Douglas R. Woodall, Edward F. Schmeichel
Publication date: 20 January 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1405.5760
Related Items (18)
Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem ⋮ Unnamed Item ⋮ Vertex arboricity and vertex degrees ⋮ Stability theorems for graph vulnerability parameters ⋮ Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor ⋮ A degree sequence version of the Kühn-Osthus tiling theorem ⋮ On sufficient conditions for Hamiltonicity of graphs, and beyond ⋮ Reciprocal degree distance and graph properties ⋮ Spectral radius and \(k\)-connectedness of a graph ⋮ Spectral conditions for some graphical properties ⋮ Adjacency relationships forced by a degree sequence ⋮ Some sufficient conditions on \(k\)-connected graphs ⋮ Some topological indices and graph properties ⋮ Wiener index, Harary index and graph properties ⋮ Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable ⋮ A distributed low tree-depth decomposition algorithm for bounded expansion classes ⋮ On the necessity of Chvátal’s Hamiltonian degree condition ⋮ Wiener-type invariants on graph properties
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Vertex arboricity and vertex degrees
- Best monotone degree conditions for binding number and cycle structure
- The binding number of a graph and its pancyclism
- Best monotone degree conditions for binding number
- Hamiltonian degree conditions which imply a graph is pancyclic
- Recognizing tough graphs is NP-hard
- A simple proof of a theorem of Jung
- The binding number of a graph and its cliques
- Lower bounds on the stability number of graphs computed in terms of degrees
- On n-Hamiltonian graphs
- A sufficient condition for Hamiltonian circuits
- A method in graph theory
- Degree sequences and edge connectivity
- Computing the binding number of a graph
- Triangles and neighbourhoods of independent sets in graphs
- Hamiltonian degree conditions for tough graphs
- Binding number and toughness for matching extension
- Degree sequences and the existence of \(k\)-factors
- Not every 2-tough graph is Hamiltonian
- Toughness and binding number
- Perfect matchings of a graph
- On Hamilton's ideals
- Tough graphs and Hamiltonian circuits.
- The strongest monotone degree condition for \(n\)-connectedness of a graph
- Binding Number, Minimum Degree, and Cycle Structure in Graphs
- Sufficient degree conditions fork-edge-connectedness of a graph
- BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF k-FACTORS
- k -Factors and Neighbourhoods of Independent Sets in Graphs
- On Maximal Circuits in Finite Graphs
- A Note on the Vertex Arboricity of a Graph
- Toughness and Vertex Degrees
- The Eigenvalues of a Graph and Its Chromatic Number
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- An inequality for the chromatic number of a graph
- A sufficient condition for n ‐connectedness of graphs
- The Point-Arboricity of Planar Graphs
- A note on K-path hamiltonian graphs
- The binding number of a graph and its Anderson number
- Some Theorems on Abstract Graphs
- A Short Proof of the Factor Theorem for Finite Graphs
This page was built for publication: Best monotone degree conditions for graph properties: a survey
