Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
edge bounds
Description:
Upper or lower limits on the number of edges in a graph, often established under specified structural or connectivity conditions.
Primary topic:
Advanced Graph Theory Research (55%)
Related topics:
Advanced Graph Theory Research (55%),
Limits and Structures in Graph Theory (25%)
OpenAlex ID:
keywords/edge-bounds
Finding and counting given length cycles
1997
·
N. Alon
, R. Yuster
, et al.
·
Algorithmica
·
756
An improved linear edge bound for graph linkages
2004
·
Robin Thomas
, Paul Wollan
·
European Journal of Combinatorics
·
155
On Concentrators, Superconcentrators, Generalizers, and Nonblocking Networks
1979
·
F. R. K. Chung
·
Bell System Technical Journal
·
92
On representations of some thickness-two graphs
1999
·
Joan P. Hutchinson
, Thomas Shermer
, et al.
·
Computational Geometry
·
80
PDF
A Bound on the Number of Edges in Graphs Without an Even Cycle
2016
·
BORIS BUKH
, ZILIN JIANG
·
Combinatorics Probability Computing
·
62
PDF
On critical graphs with chromatic index 4
1974
·
Ivan Tafteberg Jakobsen
·
Discrete Mathematics
·
58
PDF
Bar k-Visibility Graphs
2007
·
Alice M. Dean
, William Evans
, et al.
·
Journal of Graph Algorithms and Applications
·
56
Color-Critical Graphs and Hypergraphs with Few Edges: A Survey
2006
·
Alexandr Kostochka
·
Bolyai Society mathematical studies
·
54
Relaxing Planarity for Topological Graphs
2003
·
János Pach
, Radoš Radoičić
, et al.
·
Lecture notes in computer science
·
54
Finding and counting given length cycles: Extended Abstract
1994
·
Noga Alon
, Raphael Yuster
, et al.
·
Lecture notes in computer science
·
48
Properties of a Euler graph
1973
·
S. Toida
·
Journal of the Franklin Institute
·
41
The cordiality of one-point union of n copies of a graph
1993
·
Sze-Chin Shee
, Yong-Song Ho
·
Discrete Mathematics
·
40
Rectangle-visibility representations of bipartite graphs
1997
·
Alice M. Dean
, Joan P. Hutchinson
·
Discrete Applied Mathematics
·
35
PDF
Problems and Results in Combinatorial Analysis and Graph Theory
1988
·
Paul Erdöus
·
Annals of discrete mathematics
·
35
On Drawings and Decompositions of 1-Planar Graphs
2013
·
Július Czap
, Dávid Hudák
·
The Electronic Journal of Combinatorics
·
33
PDF
Some remarks on a paper by Vizing on critical graphs
1975
·
Stanley Fiorini
·
Mathematical Proceedings of the Cambridge Philosophical Society
·
30
On the interplay between graphs and matroids
2001
·
J.G. Oxley
·
Cambridge University Press eBooks
·
29
A Note on Graphs Without Short Even Cycles
2005
·
Thomas Lam
, Jacques Verstraëte
·
The Electronic Journal of Combinatorics
·
28
PDF
Relaxing Planarity for Topological Graphs
2006
·
János Pach
, Radoš Radoičić
, et al.
·
Bolyai Society mathematical studies
·
25
On the Density of Non-simple 3-Planar Graphs
2016
·
Michael A. Bekos
, Michael Kaufmann
, et al.
·
Lecture notes in computer science
·
21
On the number of edges in a graph with no (k+1) -connected subgraphs
2015
·
Anton Bernshteyn
, Alexandr Kostochka
·
Discrete Mathematics
·
20
PDF
On representations of some thickness-two graphs: Extended abstract
1996
·
Joan P. Hutchinson
, Thomas Shermer
, et al.
·
Lecture notes in computer science
·
20
PDF
Rectangle-visibility representations of bipartite graphs
1995
·
Alice M. Dean
, Joan P. Hutchinson
·
Lecture notes in computer science
·
19
PDF
Repeated distances in space
1988
·
David Avis
, Paul Erdös
, et al.
·
Graphs and Combinatorics
·
18
Vertex Partitions of K4,4-Minor Free Graphs
2001
·
Leif K. Jørgensen
·
Graphs and Combinatorics
·
17
Show more works
View as search
Works count:
139
Citation count:
2,248
Year
Topic
Type