Product
Help
Pricing
About
Jobs
Log in
Get started
Concept
Add to collection
Split graph
OpenAlex ID:
C8554925
Algebraic Graph Theory
2001
·
Chris Godsil
, Gordon Royle
·
Graduate texts in mathematics
·
8,902
Unit disk graphs
1990
·
Brent N. Clark
, Charles J. Colbourn
, et al.
·
Discrete Mathematics
·
1,627
On cliques in graphs
1965
·
J. W. Moon
, L. Moser
·
Israel Journal of Mathematics
·
1,021
The intersection graphs of subtrees in trees are exactly the chordal graphs
1974
·
Fǎnicǎ Gavril
·
Journal of Combinatorial Theory Series B
·
816
PDF
Upper bounds to the clique width of graphs
2000
·
Bruno Courcelle
, Stephan Olariu
·
Discrete Applied Mathematics
·
752
PDF
A fast algorithm for the maximum clique problem
2002
·
Patric R.J. Östergård
·
Discrete Applied Mathematics
·
686
PDF
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
1972
·
Fănică Gavril
·
SIAM Journal on Computing
·
633
An Introduction to Chordal Graphs and Clique Trees
1993
·
Jean R. S. Blair
, Barry Peyton
·
The IMA volumes in mathematics and its applications
·
559
Quasi-random graphs
1989
·
F. R. K. Chung
, R. L. Graham
, et al.
·
COMBINATORICA
·
557
Decomposition by clique separators
1985
·
Robert E. Tarjan
·
Discrete Mathematics
·
472
Polynomial Algorithms for Perfect Graphs
1984
·
M. Grötschel
, L. Lovász
, et al.
·
North-Holland mathematics studies
·
464
PDF
On the parameterized complexity of multiple-interval graph problems
2008
·
Michael R. Fellows
, Danny Hermelin
, et al.
·
Theoretical Computer Science
·
430
A characterization of perfect graphs
1972
·
L Lovász
·
Journal of Combinatorial Theory Series B
·
403
PDF
Approximating maximum independent sets by excluding subgraphs
1992
·
Ravi Boppana
, Magnús M. Halldórsson
·
BIT Numerical Mathematics
·
402
Random graphs with a given degree sequence
2011
·
Sourav Chatterjee
, Persi Diaconis
, et al.
·
The Annals of Applied Probability
·
346
PDF
Efficient algorithms for interval graphs and circular‐arc graphs
1982
·
U. I. Gupta
, D. T. Lee
, et al.
·
Networks
·
306
An Introduction to Temporal Graphs: An Algorithmic Perspective *
2016
·
Othon Michail
·
Internet Mathematics
·
300
PDF
Perfect graphs
2004
·
Martin Charles Golumbic
·
Annals of discrete mathematics
·
276
Clustering and domination in perfect graphs
1984
·
D.G. Corneil
, Y. Perl
·
Discrete Applied Mathematics
·
275
On the Clique-width of Some Perfect Graph Classes
2000
·
MARTIN CHARLES GOLUMBIC
, UDI ROTICS
·
International Journal of Foundations of Computer Science
·
266
The splittance of a graph
1981
·
Peter L. Hammer
, Bruno Simeone
·
COMBINATORICA
·
262
Deciding First-Order Properties of Nowhere Dense Graphs
2017
·
Martin Grohe
, Stephan Kreutzer
, et al.
·
Journal of the ACM
·
246
PDF
On‐line and first fit colorings of graphs
1988
·
A. Gyárfás
, J. Lehel
·
Journal of Graph Theory
·
233
The structure of claw-free graphs
2005
·
Maria Chudnovsky
, Paul Seymour
·
Cambridge University Press eBooks
·
229
Dominating sets for split and bipartite graphs
1984
·
Alan A. Bertossi
·
Information Processing Letters
·
227
Show more works
View as search
Works count:
4,079
Citation count:
66,900
Year
Topic
Type