Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
edge sets
Description:
A set of edges in a graph, used in graph theory and computational operations on networks.
Primary topic:
Advanced Graph Theory Research (33%)
Related topics:
Advanced Graph Theory Research (33%),
Graph theory and applications (10%)
Wikidata ID:
wiki/Q124247109
OpenAlex ID:
keywords/edge-sets
The Factors of Graphs
1952
·
W. T. Tutte
·
Canadian Journal of Mathematics
·
413
PDF
Sets of Independent Edges of a Hypergraph
1976
·
B. BOLLOBÁS
, D. E. DAYKIN
, et al.
·
The Quarterly Journal of Mathematics
·
158
Intersecting families of edges in hypergraphs having the hereditary property
1974
·
V. Chvátal
·
Lecture notes in mathematics
·
91
A note on the line reconstruction problem
1972
·
L Lovász
·
Journal of Combinatorial Theory Series B
·
87
PDF
Facets of the Bipartite Subgraph Polytope
1985
·
Francisco Barahona
, Martin Grötschel
, et al.
·
Mathematics of Operations Research
·
82
A Nonlinear Elastic Shape Averaging Approach
2009
·
Martin Rumpf
, Benedikt Wirth
·
SIAM Journal on Imaging Sciences
·
68
Topologies on the edges set of directed graphs
2018
·
Khalid Abdulkalek Abdu
, Adem Kilicman
·
International Journal of Mathematical Analysis
·
47
A generalization of diagonal flips in a convex polygon
2000
·
Tomoki Nakamigawa
·
Theoretical Computer Science
·
44
PDF
Set And Its Operations
2021
·
Mohammadesmail Nikfar
·
Preprints.org
·
40
PDF
General neighbour-distinguishing index of a graph
2007
·
Ervin Győri
, Mirko Horňák
, et al.
·
Discrete Mathematics
·
38
PDF
On the chromatic number of some geometric type Kneser graphs
2004
·
G. Araujo
, A. Dumitrescu
, et al.
·
Computational Geometry
·
38
PDF
Network identification with partial excitation and measurement
2019
·
Alexandre S. Bazanella
, Michel Gevers
, et al.
·
IEEE Conference on Decision and Control (CDC)
·
37
Uniqueness of Orthogonal Connect-the-Dots
1988
·
Joseph O'ROURKE
·
Machine intelligence and pattern recognition
·
34
A dynamic algorithm for line graph recognition
1995
·
Daniele Giorgio Degiorgi
, Klaus Simon
·
Lecture notes in computer science
·
30
Total forcing number of the triangular grid
2004
·
Damir Vukičević
, Jelena Sedlar
·
Mathematical communications
·
29
setsApp: Set operations for Cytoscape Nodes and Edges
2014
·
John H. Morris
, Allan Wu
, et al.
·
F1000Research
·
25
PDF
Construction of a minimax solution for an eikonal-type equation
2008
·
P. D. Lebedev
, A. A. Uspenskii
, et al.
·
Proceedings of the Steklov Institute of Mathematics
·
25
The Covariance of Topological Indices that Depend on the Degree of a Vertex
2004
·
Hollas, Boris
·
arXiv (Cornell University)
·
25
PDF
Covering and independence in triangle structures
1996
·
Paul Erdös
, Tibor Gallai
, et al.
·
Discrete Mathematics
·
22
PDF
Bijective proofs of two broken circuit theorems
1986
·
Andreas Blass
, Bruce Eli Sagan
·
Journal of Graph Theory
·
22
Manifolds in stacked 4-polytopes
1971
·
Amos Altshuler
·
Journal of Combinatorial Theory Series A
·
19
Topological Circles and Euler Tours in Locally Finite Graphs
2009
·
Agelos Georgakopoulos
·
The Electronic Journal of Combinatorics
·
18
PDF
Effective co-betweenness centrality computation
2014
·
Mostafa Haghir Chehreghani
·
ACM International Conference on Web Search and Data Mining (WSDM)
·
17
PDF
G-strokes: A concept for simplifying line stylization
2006
·
Tobias Isenberg
, Angela Brennecke
·
Computers & Graphics
·
16
Independence and cycles in super line graphs.
1999
·
Jay S. Bagga
, Lowell W. Beineke
, et al.
·
Australas. J Comb.
·
13
Show more works
View as search
Works count:
132
Citation count:
1,637
Year
Topic
Type