Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
maximum degree
Description:
In graph theory, the maximum degree is the greatest number of edges incident to any vertex in a graph.
Primary topic:
Advanced Graph Theory Research (32%)
Related topics:
Advanced Graph Theory Research (32%),
Graph Labeling and Dimension Problems (26%),
Limits and Structures in Graph Theory (10%),
Graph theory and applications (9%),
Complexity and Algorithms in Graphs (9%)
Wikidata ID:
wiki/Q9346061
OpenAlex ID:
keywords/maximum-degree
Introduction to Graph Theory
2010
·
Walter D. Wallis
, John C. George
·
Chapman & Hall/CRC eBooks
·
5,631
Approximation Algorithms for Connected Dominating Sets
1998
·
S. Guha
, S. Khuller
·
Algorithmica
·
1,133
On the ratio of optimal integral and fractional covers
1975
·
L. Lovász
·
Discrete Mathematics
·
1,115
A fast and simple randomized parallel algorithm for the maximal independent set problem
1986
·
Noga Alon
, László Babai
, et al.
·
Journal of Algorithms
·
824
Labelling Graphs with a Condition at Distance 2
1992
·
Jerrold R. Griggs
, Roger K. Yeh
·
SIAM Journal on Discrete Mathematics
·
717
The theory of stochastic processes
1966
·
Athanasios Papoulis
·
Journal of the Franklin Institute
·
686
Lower Bounds for the Partitioning of Graphs
1973
·
W. E. Donath
, A. J. Hoffman
·
IBM Journal of Research and Development
·
661
Eigenvalues of the Laplacian of a graph ∗
1985
·
William N. Anderson
, Thomas D. Morley
·
Linear and Multilinear Algebra
·
475
Approximation Algorithms for Connected Dominating Sets
2007
·
S. Guha
, S. Khuller
·
Algorithmica
·
447
PDF
Approximation algorithms for connected dominating sets
1996
·
Sudipto Guha
, Samir Khuller
·
Lecture notes in computer science
·
442
Approximate graph coloring by semidefinite programming
1998
·
David Karger
, Rajeev Motwani
, et al.
·
Journal of the ACM
·
420
Counting independent sets up to the tree threshold
2006
·
Dror Weitz
·
ACM Symposium on Theory of Computing (STOC)
·
411
New Algorithms for Enumerating All Maximal Cliques
2004
·
Kazuhisa Makino
, Takeaki Uno
·
Lecture notes in computer science
·
410
The $L(2,1)$-Labeling Problem on Graphs
1996
·
Gerard J. Chang
, David Kuo
·
SIAM Journal on Discrete Mathematics
·
372
Explicit construction of linear sized tolerant networks
1988
·
N. Alon
, F.R.K. Chung
·
Discrete Mathematics
·
325
The List Chromatic Index of a Bipartite Multigraph
1995
·
F. Galvin
·
Journal of Combinatorial Theory Series B
·
309
A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
1995
·
Mark Jerrum
·
Random Structures and Algorithms
·
288
Drawing Planar Graphs Using the Canonical Ordering
1996
·
G. Kant
·
Algorithmica
·
283
Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
1997
·
Alessandro Panconesi
, Aravind Srinivasan
·
SIAM Journal on Computing
·
268
Minimum-latency aggregation scheduling in multihop wireless networks
2009
·
Peng-Jun Wan
, Scott C.-H. Huang
, et al.
·
ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)
·
256
Large subway systems as complex networks
2005
·
Panagiotis Angeloudis
, David Fisk
·
Physica A Statistical Mechanics and its Applications
·
246
List Edge and List Total Colourings of Multigraphs
1997
·
O.V. Borodin
, A.V. Kostochka
, et al.
·
Journal of Combinatorial Theory Series B
·
242
On Correlation-immune functions
2007
·
P. Camion
, C. Carlet
, et al.
·
Springer eBooks
·
232
Adjacent strong edge coloring of graphs
2002
·
Zhongfu Zhang
, Linzhong Liu
, et al.
·
Applied Mathematics Letters
·
232
PDF
Acyclic coloring of graphs
1991
·
Noga Alon
, Colin Mcdiarmid
, et al.
·
Random Structures and Algorithms
·
229
Show more works
View as search
Works count:
6,661
Citation count:
78,580
Year
Topic
Type
