Get started
Keyword

minimum degree

Description: Minimum degree is a graph-theoretic property giving the smallest number of edges incident to any vertex in a graph.
Wikidata ID: wiki/Q106553065
OpenAlex ID: keywords/minimum-degree
Introduction to Graph Theory
2010 · Walter D. Wallis, John C. George · Chapman & Hall/CRC eBooks · 5,631
Network structure and minimum degree
1983 · Stephen B. Seidman · Social Networks · 1,898
Onk-connectivity for a geometric random graph
1999 · Mathew D. Penrose · Random Structures and Algorithms · 439
Sudden Emergence of a Giantk-Core in a Random Graph
1996 · Boris Pittel, Joel Spencer, et al. · Journal of Combinatorial Theory Series B · 438
On the maximal number of independent circuits in a graph
1963 · G. Dirac, P. Erdõs · Acta Mathematica Academiae Scientiarum Hungaricae · 231
Spanning Trees with Many Leaves
1991 · Daniel J. Kleitman, Douglas B. West · SIAM Journal on Discrete Mathematics · 199
Approximating theDomatic Number
2002 · Uriel Feige, Magnús M. Halldórsson, et al. · SIAM Journal on Computing · 187
Hardness and algorithms for rainbow connection
2009 · Sourav Chakraborty, Eldar Fischer, et al. · Journal of Combinatorial Optimization · 181
PDF
On Rainbow Connection
2008 · Yair Caro, Arie Lev, et al. · The Electronic Journal of Combinatorics · 178
PDF
The rainbow connection of a graph is (at most) reciprocal to its minimum degree
2009 · Michael Krivelevich, Raphael Yuster · Journal of Graph Theory · 173
A Sharp Upper Bound of the Spectral Radius of Graphs
2001 · Yuan Hong, Jin-Long Shu, et al. · Journal of Combinatorial Theory Series B · 164
H-Factors in Dense Graphs
1996 · Noga Alon, Raphael Yuster · Journal of Combinatorial Theory Series B · 163
An approximate Dirac-type theorem for k-uniform hypergraphs
2008 · Vojtěch Rödl, Endre Szemerédi, et al. · COMBINATORICA · 152
Proof of the Seymour conjecture for large graphs
1998 · János Komlós, Gábor N. Sárközy, et al. · Annals of Combinatorics · 152
The (n, k)-star graph: A generalized star graph
1995 · Chiang Wei-Kuo, Chen Rong-Jaye · Information Processing Letters · 148
On graph irregularity strength
2002 · Alan Frieze, Ronald J. Gould, et al. · Journal of Graph Theory · 147
Cops and robbers in graphs with large girth and Cayley graphs
1987 · Peter Frankl · Discrete Applied Mathematics · 144
PDF
Proof of the Alon–Yuster conjecture
2001 · János Komlós, Gábor Sárközy, et al. · Discrete Mathematics · 139
PDF
Maximally connected digraphs
1989 · J. Fàbrega, M. A. Fiol · Journal of Graph Theory · 139
The structure of 1-planar graphs
2007 · Igor Fabrici, Tomáš Madaras · Discrete Mathematics · 137
PDF
Dense graphs are antimagic
2004 · N. Alon, G. Kaplan, et al. · Journal of Graph Theory · 135
PDF
Laplacian spectra of, and random walks on, complex networks: Are scale-free architectures really important?
2008 · A. N. Samukhin, S. N. Dorogovtsev, et al. · Physical Review E · 125
PDF
Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree
2006 · Daniela Kühn, Deryk Osthus · Journal of Combinatorial Theory Series B · 125
PDF
Dirac-Type Questions For Hypergraphs — A Survey (Or More Problems For Endre To Solve)
2010 · Vojtech Rödl, Andrzej RuciŃski · Bolyai Society mathematical studies · 123
The early evolution of the H-free process
2010 · Tom Bohman, Peter Keevash · Inventiones mathematicae · 120
PDF
Works count: 3,846
Citation count: 38,710
Year
Topic
Type