Fetching the paper…
Reading the bibliography…
The degeneracy of an $n$-vertex graph $G$ is the smallest number $d$ such that every subgraph of $G$ contains a vertex of degree at most $d$.
A method of matrix analysis of group structure
R. D. Luce and A. D. Perry · 1949
Earlier work this paper cites.
A procedure for clique detection using the group matrix
F. Harary and I. C. Ross · 1957
Earlier work this paper cites.
On cliques in graphs
J. W. Moon and L. Moser · 1965
Earlier work this paper cites.
On chromatic number of graphs and set-systems
P. Erdős and A. Hajnal · 1966
Earlier work this paper cites.
An analysis of some graph theoretical cluster techniques
J. G. Augustson and J. Minker · 1970
Earlier work this paper cites.
k k -degenerate graphs
D. R. Lick and A. T. White · 1970
Earlier work this paper cites.
Graph Theory
F. Harary · 1972
Earlier work this paper cites.
Corrections to Bierstone’s algorithm for generating cliques
G. D. Mulligan and D. G. Corneil · 1972
Earlier work this paper cites.
The enumeration of maximal cliques of large graphs
E. A. Akkoyunlu · 1973
Earlier work this paper cites.
Algorithm 457: finding all cliques of an undirected graph
C. Bron and J. Kerbosch · 1973
Earlier work this paper cites.
Cliques of a graph—variations on the Bron–Kerbosch algorithm
H. C. Johnston · 1976
Earlier work this paper cites.
A new algorithm for generating all the maximal independent sets
S. Tsukiyama, M. Ide, H. Ariyoshi, and I. Shirakawa · 1977
Earlier work this paper cites.
Clique detection for nondirected graphs: Two new algorithms
L. Gerhards and W. Lindenberg · 1979
Earlier work this paper cites.
Generating all maximal independent sets: NP-hardness and polynomial-time algorithms
E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan · 1980
Earlier work this paper cites.
A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically
E. Loukakis and C. Tsouros · 1981
Earlier work this paper cites.
A sufficient condition for backtrack-free search
E. C. Freuder · 1982
Earlier work this paper cites.
Arboricity and subgraph listing algorithms
N. Chiba and T. Nishizeki · 1985
Earlier work this paper cites.
Markov graphs
O. Frank and D. Strauss · 1986
Earlier work this paper cites.
On generating all maximal in- dependent sets
D. S. Johnson, M. Yannakakis, and C. H. Papadimitriou · 1988
Cited alongside, same era.
Stereo correspondence through feature grouping and maximal cliques
R. Horaud and T. Skordas · 1989
Cited alongside, same era.
Planar orientations with low out-degree and compaction of adjacency matrices
M. Chrobak and D. Eppstein · 1991
Cited alongside, same era.
Statistical analysis of change in networks
O. Frank · 1991
Cited alongside, same era.
Identification of tertiary structure resemblance in proteins using a maximal common subgraph isomorphism algorithm
H. M. Grindley, P. J. Artymiuk, D. W. Rice, and P. Willett · 1993
Cited alongside, same era.
Fixed-parameter tractability and completeness II: On completeness for W[1]
R. G. Downey and M. R. Fellows · 1995
An O ( m ) O(m) algorithm for cores decomposition of networks, 2003, arXiv:cs/0310049
V. Batagelj and M. Zaveršnik · 2003
Later among the works it cites.
Small maximal independent sets and faster exact graph coloring
D. Eppstein · 2003
Later among the works it cites.
Emergent clique formation in terrorist recruitment
N. M. Berry, T. H. Ko, T. Moy, J. Smrcka, J. Turnley, and B. Wu · 2004
Later among the works it cites.
New algorithms for enumerating all maximal cliques
K. Makino and T. Uno · 2004
Later among the works it cites.
Random separation: A new method for solving fixed-cardinality optimization problems
L. Cai, S. Chan, and S. Chan · 2006
Later among the works it cites.
Bounded arboricity to determine the local structure of sparse graphs
G. Goel and J. Gustedt · 2006
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Graph Coloring Problems
T. R. Jensen and B. Toft · 1995
Cited alongside, same era.
The linkage of a graph
L. Kirousis and D. Thilikos · 1996
Cited alongside, same era.
An algorithm for finding maximal common subtopologies in a set of protein structures
I. Koch, T. Lengauer, and E. Wanke · 1996
Cited alongside, same era.
Logit models and logistic regressions for social networks: I. An introduction to Markov graphs and p ∗ p^{*}
S. Wasserman and P. Pattison · 1996
Cited alongside, same era.
New algorithms for fast discovery of association rules
M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li · 1997
Cited alongside, same era.
A graph-theoretic algorithm for comparative modeling of protein structure
R. Samudrala and J. Moult · 1998
Cited alongside, same era.
Advances in exponential random graph ( p ∗ p^{*} ) models
G. Robins and M. Morris · 2006
Later among the works it cites.
BioGRID: a general repository for interaction datasets
C. Stark, B.-J. Breitkreutz, T. Reguly, L. Boucher, A. Breitkreutz, and M. Tyers · 2006
Later among the works it cites.
The worst-case time complexity for generating all maximal cliques and computational experiments
E. Tomita, A. Tanaka, and H. Takahashi · 2006
Later among the works it cites.
Community detection in large-scale social networks
N. Du, B. Wu, X. Pei, B. Wang, and L. Xu · 2007
Later among the works it cites.
On the maximum number of cliques in a graph
D. R. Wood · 2007
Later among the works it cites.
A note on the problem of reporting maximal cliques
F. Cazals and C. Karande · 2008
Later among the works it cites.
Parameterized complexity for domination problems on degenerate graphs
P. A. Golovach and Y. Villanger · 2008
Later among the works it cites.
Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
N. Alon and S. Gutner · 2009
Later among the works it cites.
All maximal independent sets and dynamic dominance for sparse graphs
D. Eppstein · 2009
Later among the works it cites.
The h h -index of a graph and its application to dynamic subgraph statistics
D. Eppstein and E. S. Spiro · 2009
Later among the works it cites.
The tidy set: a minimal simplicial set for computing homology of clique complexes
A. Zomorodian · 2010
Closest in time.