Keyword

graph classes

Description: Graph classes are sets of graphs defined by shared structural properties, studied in graph theory for their relationships, algorithms, and optimization problems.

Primary topic: Advanced Graph Theory Research (63%)

Wikidata ID: wiki/Q130376455

OpenAlex ID: keywords/graph-classes

Algorithmic Graph Theory and Perfect Graphs

2004 · Annals of discrete mathematics · 3,729

Graph Classes: A Survey

1999 · Andreas Brandstädt, Van Bang Le, et al. · Society for Industrial and Applied Mathematics eBooks · 1,758

A partial k-arboretum of graphs with bounded treewidth

1998 · Hans L. Bodlaender · Theoretical Computer Science · 1,106

A family of cubical graphs

1947 · W. T. Tutte · Mathematical Proceedings of the Cambridge Philosophical Society · 478

Decomposition by clique separators

1985 · Robert E. Tarjan · Discrete Mathematics · 437

Efficient Graph Representations

2003 · Jeremy Spinrad · American Mathematical Society eBooks · 370

Problems from the world surrounding perfect graphs

1987 · A. Gyárfás · Applicationes Mathematicae · 363

PDF

A Characterization of Distance-hereditary Graphs

1977 · EDWARD HOWORKA · The Quarterly Journal of Mathematics · 249

Bipartite permutation graphs

1987 · Jeremy Spinrad, Andreas Brandstädt, et al. · Discrete Applied Mathematics · 231

Weakly triangulated graphs

1985 · Ryan B Hayward · Journal of Combinatorial Theory Series B · 230

PDF

Deciding first-order properties of locally tree-decomposable structures

2001 · Markus Frick, Martin Grohe · Journal of the ACM · 226

PDF

Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees

1990 · Hans L Bodlaender · Journal of Algorithms · 216

Uniquely identifying the edges of a graph: The edge metric dimension

2018 · Aleksander Kelenc, Niko Tratnik, et al. · Discrete Applied Mathematics · 215

On the Complexity of General Graph Factor Problems

1983 · D. G. Kirkpatrick, P. Hell · SIAM Journal on Computing · 207

Sparsity (Graphs, Structures, and Algorithms)

2012 · Nesetril, Jaroslav, Ossona de Mendez, Patrice · HAL (Le Centre pour la Communication Scientifique Directe) · 201

Super Edge-magic Graphs

1998 · Hikoe Enomoto, Anna S. Llado, et al. · SUT Journal of Mathematics · 187

PDF

House of Graphs: A database of interesting graphs

2012 · Gunnar Brinkmann, Kris Coolsaet, et al. · Discrete Applied Mathematics · 184

Extremality of degree-based graph entropies

2014 · Shujuan Cao, Matthias Dehmer, et al. · Information Sciences · 182

Treewidth and Minimum Fill-in: Grouping the Minimal Separators

2001 · Vincent Bouchitté, Ioan Todinca · SIAM Journal on Computing · 178

On the Complexity of Distributed Network Decomposition

1996 · Alessandro Panconesi, Aravind Srinivasan · Journal of Algorithms · 176

The Pathwidth and Treewidth of Cographs

1993 · Hans L. Bodlaender, Rolf H. Möhring · SIAM Journal on Discrete Mathematics · 176

The L(h, k)-Labelling Problem: An Updated Survey and Annotated Bibliography

2011 · T. Calamoneri · The Computer Journal · 167

On the metric dimension of some families of graphs

2005 · Carmen Hernando, Mercè Mora, et al. · Electronic Notes in Discrete Mathematics · 164

Linear-Time Recognition of Circular-Arc Graphs

2003 · Ross M. McConnell · Algorithmica · 160

When is the evaluation of conjunctive queries tractable?

2001 · Martin Grohe, Thomas Schwentick, et al. · ACM Symposium on Theory of Computing (STOC) · 156

Works count: 5,705

Citation count: 44,530