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

@@ Property / OpenAlex ID @@
+W2046857096
@@ Property / OpenAlex ID: W2046857096 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.5760
@@ Property / arXiv ID: 1405.5760 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4004078
@@ Property / cites work: Q4004078 / rank @@
+Normal rank
@@ Property / cites work @@
+Perfect matchings of a graph
@@ Property / cites work: Perfect matchings of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Degree sequences and the existence of \(k\)-factors
+Normal rank
@@ Property / cites work @@
+Toughness and Vertex Degrees
@@ Property / cites work: Toughness and Vertex Degrees / rank @@
+Normal rank
@@ Property / cites work @@
+Not every 2-tough graph is Hamiltonian
@@ Property / cites work: Not every 2-tough graph is Hamiltonian / rank @@
+Normal rank
@@ Property / cites work @@
+Sufficient degree conditions for<i>k</i>-edge-connectedness of a graph
+Normal rank
@@ Property / cites work @@
+Recognizing tough graphs is NP-hard
@@ Property / cites work: Recognizing tough graphs is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+Q5405465
@@ Property / cites work: Q5405465 / rank @@
+Normal rank
@@ Property / cites work @@
+Toughness and binding number
@@ Property / cites work: Toughness and binding number / rank @@
+Normal rank
@@ Property / cites work @@
+Best monotone degree conditions for binding number
+Normal rank
@@ Property / cites work @@
+A simple proof of a theorem of Jung
@@ Property / cites work: A simple proof of a theorem of Jung / rank @@
+Normal rank
@@ Property / cites work @@
+Q2971216
@@ Property / cites work: Q2971216 / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex arboricity and vertex degrees
@@ Property / cites work: Vertex arboricity and vertex degrees / rank @@
+Normal rank
@@ Property / cites work @@
+Best monotone degree conditions for binding number and cycle structure
+Normal rank
@@ Property / cites work @@
+Hamiltonian degree conditions which imply a graph is pancyclic
+Normal rank
@@ Property / cites work @@
+Binding Number, Minimum Degree, and Cycle Structure in Graphs
+Normal rank
@@ Property / cites work @@
+Q5668821
@@ Property / cites work: Q5668821 / rank @@
+Normal rank
@@ Property / cites work @@
+The strongest monotone degree condition for \(n\)-connectedness of a graph
+Normal rank
@@ Property / cites work @@
+Q5576241
@@ Property / cites work: Q5576241 / rank @@
+Normal rank
@@ Property / cites work @@
+A method in graph theory
@@ Property / cites work: A method in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Q5580168
@@ Property / cites work: Q5580168 / rank @@
+Normal rank
@@ Property / cites work @@
+A sufficient condition for             <i>n</i>             ‐connectedness of graphs
+Normal rank
@@ Property / cites work @@
+The Point-Arboricity of Planar Graphs
@@ Property / cites work: The Point-Arboricity of Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3065457
@@ Property / cites work: Q3065457 / rank @@
+Normal rank
@@ Property / cites work @@
+Binding number and toughness for matching extension
+Normal rank
@@ Property / cites work @@
+On Hamilton's ideals
@@ Property / cites work: On Hamilton's ideals / rank @@
+Normal rank
@@ Property / cites work @@
+Tough graphs and Hamiltonian circuits.
@@ Property / cites work: Tough graphs and Hamiltonian circuits. / rank @@
+Normal rank
@@ Property / cites work @@
+Computing the binding number of a graph
@@ Property / cites work: Computing the binding number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Some Theorems on Abstract Graphs
@@ Property / cites work: Some Theorems on Abstract Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5545303
@@ Property / cites work: Q5545303 / rank @@
+Normal rank
@@ Property / cites work @@
+A Note on the Vertex Arboricity of a Graph
@@ Property / cites work: A Note on the Vertex Arboricity of a Graph / rank @@
+Normal rank
@@ Property / cites work @@
+Hamiltonian degree conditions for tough graphs
@@ Property / cites work: Hamiltonian degree conditions for tough graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On Maximal Circuits in Finite Graphs
@@ Property / cites work: On Maximal Circuits in Finite Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+BINDING NUMBERS OF GRAPHS AND THE EXISTENCE OF <i>k</i>-FACTORS
+Normal rank
@@ Property / cites work @@
+Degree sequences and edge connectivity
@@ Property / cites work: Degree sequences and edge connectivity / rank @@
+Normal rank
@@ Property / cites work @@
+A note on K-path hamiltonian graphs
@@ Property / cites work: A note on K-path hamiltonian graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On n-Hamiltonian graphs
@@ Property / cites work: On n-Hamiltonian graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The binding number of a graph and its cliques
@@ Property / cites work: The binding number of a graph and its cliques / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds on the stability number of graphs computed in terms of degrees
+Normal rank
@@ Property / cites work @@
+Q5628162
@@ Property / cites work: Q5628162 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5722819
@@ Property / cites work: Q5722819 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3941440
@@ Property / cites work: Q3941440 / rank @@
+Normal rank
@@ Property / cites work @@
+Triangles and neighbourhoods of independent sets in graphs
+Normal rank
@@ Property / cites work @@
+The binding number of a graph and its pancyclism
@@ Property / cites work: The binding number of a graph and its pancyclism / rank @@
+Normal rank
@@ Property / cites work @@
+An inequality for the chromatic number of a graph
@@ Property / cites work: An inequality for the chromatic number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+A Short Proof of the Factor Theorem for Finite Graphs
+Normal rank
@@ Property / cites work @@
+An upper bound for the chromatic number of a graph and its application to timetabling problems
+Normal rank
@@ Property / cites work @@
+The Eigenvalues of a Graph and Its Chromatic Number
+Normal rank
@@ Property / cites work @@
+The binding number of a graph and its Anderson number
+Normal rank
@@ Property / cites work @@
+A sufficient condition for Hamiltonian circuits
@@ Property / cites work: A sufficient condition for Hamiltonian circuits / rank @@
+Normal rank
@@ Property / cites work @@
+<i>k</i> -Factors and Neighbourhoods of Independent Sets in Graphs
+Normal rank