Product
Help
Pricing
About
Jobs
Log in
Get started
Concept
Add to collection
1-planar graph
OpenAlex ID:
C102192266
Algebraic Graph Theory
2001
·
Chris Godsil
, Gordon Royle
·
Graduate texts in mathematics
·
8,904
Graph evolution: Densification and shrinking diameters
2007
·
Jure Leskovec
, Jon Kleinberg
, et al.
·
ACM Transactions on Knowledge Discovery from Data
·
3,160
PDF
A critical point for random graphs with a given degree sequence
1995
·
Michael Molloy
, Bruce Reed
·
Random Structures and Algorithms
·
2,716
The monadic second-order logic of graphs. I. Recognizable sets of finite graphs
1990
·
Bruno Courcelle
·
Information and Computation
·
1,971
PDF
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
1996
·
Hans L. Bodlaender
·
SIAM Journal on Computing
·
1,896
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
1976
·
Kellogg S. Booth
, George S. Lueker
·
Journal of Computer and System Sciences
·
1,700
Unit disk graphs
1990
·
Brent N. Clark
, Charles J. Colbourn
, et al.
·
Discrete Mathematics
·
1,628
A partial k-arboretum of graphs with bounded treewidth
1998
·
Hans L. Bodlaender
·
Theoretical Computer Science
·
1,414
The Maximum Clique Problem
1999
·
Immanuel M. Bomze
, Marco Budinich
, et al.
·
Springer eBooks
·
1,315
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
1995
·
Farid Alizadeh
·
SIAM Journal on Optimization
·
1,040
Graph minors. V. Excluding a planar graph
1986
·
Neil Robertson
, P.D Seymour
·
Journal of Combinatorial Theory Series B
·
1,020
Graph minors. III. Planar tree-width
1984
·
Neil Robertson
, P.D Seymour
·
Journal of Combinatorial Theory Series B
·
996
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width
2000
·
B. Courcelle
, J. A. Makowsky
, et al.
·
Theory of Computing Systems
·
967
Complement reducible graphs
1981
·
D.G. Corneil
, H. Lerchs
, et al.
·
Discrete Applied Mathematics
·
946
The degree sequence of a scale‐free random graph process
2001
·
B´ela Bollobás
, Oliver Riordan
, et al.
·
Random Structures and Algorithms
·
926
Signed graphs
1982
·
Thomas Zaslavsky
·
Discrete Applied Mathematics
·
861
PDF
Optimal packing and covering in the plane are NP-complete
1981
·
Robert J. Fowler
, Michael S. Paterson
, et al.
·
Information Processing Letters
·
837
Treewidth: Computations and Approximations
1994
·
Ton Kloks
·
830
Congruent Graphs and the Connectivity of Graphs
1992
·
Hassler Whitney
·
Birkhäuser Boston eBooks
·
828
Regular Partitions of Graphs
1975
·
Endre Szemerédi
·
826
Convergent sequences of dense graphs I: Subgraph frequencies, metric properties and testing
2008
·
C. Borgs
, J.T. Chayes
, et al.
·
Advances in Mathematics
·
820
PDF
The intersection graphs of subtrees in trees are exactly the chordal graphs
1974
·
Fǎnicǎ Gavril
·
Journal of Combinatorial Theory Series B
·
816
PDF
Graph minors. I. Excluding a forest
1983
·
Neil Robertson
, P.D. Seymour
·
Journal of Combinatorial Theory Series B
·
760
Applications of a Planar Separator Theorem
1980
·
Richard J. Lipton
, Robert Endre Tarjan
·
SIAM Journal on Computing
·
757
Upper bounds to the clique width of graphs
2000
·
Bruno Courcelle
, Stephan Olariu
·
Discrete Applied Mathematics
·
754
PDF
Show more works
View as search
Works count:
18,660
Citation count:
333,100
Year
Topic
Type