Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
edge count
Description:
A graph property equal to the number of edges in a graph, used in graph theory and combinatorics.
Primary topic:
Limits and Structures in Graph Theory (22%)
Related topics:
Limits and Structures in Graph Theory (22%),
Advanced Graph Theory Research (22%),
Graph theory and applications (10%)
Wikidata ID:
wiki/Q1332313
OpenAlex ID:
keywords/edge-count
Pancyclic graphs I
1971
·
J.A Bondy
·
Journal of Combinatorial Theory Series B
·
494
PDF
A faster divide-and-conquer algorithm for constructing delaunay triangulations
1987
·
Rex A. Dwyer
·
Algorithmica
·
259
The Moore Bound for Irregular Graphs
2002
·
Noga Alon
, Shlomo Hoory
, et al.
·
Graphs and Combinatorics
·
251
Pancyclic graphs II
1976
·
J.A Bondy
, A.W Ingleton
·
Journal of Combinatorial Theory Series B
·
222
Superconcentrators
1977
·
Nicholas Pippenger
·
SIAM Journal on Computing
·
173
PDF
Untitled
1999
·
Journal of Graph Theory
·
172
Algorithms for Graph Rigidity and Scene Analysis
2003
·
Alex R. Berg
, Tibor Jordán
·
Lecture notes in computer science
·
119
Cutting through the clutter: Searching for targets in evolving complex scenes
2011
·
M. B. Neider
, G. J. Zelinsky
·
Journal of Vision
·
97
New Graph Of Graph
2021
·
Mohammadesmail Nikfar
·
Preprints.org
·
77
PDF
Graphs with E Edges Have Pagenumber O(√E)
1994
·
S.M. Malitz
·
Journal of Algorithms
·
72
Triangles in an Ordinary Graph
1963
·
E. A. Nordhaus
, B. M. Stewart
·
Canadian Journal of Mathematics
·
63
PDF
PROXIMITY GRAPHS: E, δ, Δ, χ AND ω
2012
·
PROSENJIT BOSE
, VIDA DUJMOVIĆ
, et al.
·
International Journal of Computational Geometry & Applications
·
60
Fault‐tolerant broadcast graphs
1985
·
Arthur L. Liestman
·
Networks
·
59
On random planar graphs, the number of planar graphs and their triangulations
2003
·
Deryk Osthus
, Hans Jürgen Prömel
, et al.
·
Journal of Combinatorial Theory Series B
·
56
PDF
Turán graphs with bounded matching number
2023
·
Noga Alon
, Péter Frankl
·
Journal of Combinatorial Theory Series B
·
51
PDF
On judicious bisections of graphs
2014
·
Baogang Xu
, Xingxing Yu
·
Journal of Combinatorial Theory Series B
·
47
PDF
Chordal Completions of Planar Graphs
1994
·
F.R.K. Chung
, D. Mumford
·
Journal of Combinatorial Theory Series B
·
46
Applications of Klee’s Dehn–Sommerville Relations
2009
·
Isabella Novik
, Ed Swartz
·
Discrete & Computational Geometry
·
44
PDF
Random maximalH-free graphs
2000
·
Deryk Osthus
, Anusch Taraz
·
Random Structures and Algorithms
·
43
New upper bounds on harmonious colorings
1994
·
Keith Edwards
, Colin McDiarmid
·
Journal of Graph Theory
·
43
The Weak Gap Property in Metric Spaces of Bounded Doubling Dimension
2009
·
Michiel Smid
·
Lecture notes in computer science
·
42
PDF
On the thickness and arboricity of a graph
1991
·
Alice M Dean
, Joan P Hutchinson
, et al.
·
Journal of Combinatorial Theory Series B
·
40
Counting acyclic digraphs by sources and sinks
1996
·
Ira M. Gessel
·
Discrete Mathematics
·
38
PDF
Inhomogeneous random graphs, isolated vertices, and Poisson approximation
2018
·
Mathew D. Penrose
·
Journal of Applied Probability
·
36
PDF
A note on 1-planar graphs
2014
·
Eyal Ackerman
·
Discrete Applied Mathematics
·
36
PDF
Show more works
View as search
Works count:
407
Citation count:
4,491
Year
Topic
Type