On the public citation graph
Recent Trends in Graph Theory
0 signed · 54 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jctb.2000.2019openalex-snapshot
Line Graphs and Forbidden Induced Subgraphs
inferred← citeshttps://doi.org/10.1007/978-94-010-1826-5_12openalex-snapshot
Applications of Ramsey Style Theorems to Eigenvalues of Graphs
inferred← citeshttps://doi.org/10.1007/bf01210217openalex-snapshot
Bidegree of graph and degeneracy number
inferred← citeshttps://doi.org/10.1007/bf02017918openalex-snapshot
Canonical bijection betweenD of (0, 1)-matrix semigroupsof (0, 1)-matrix semigroups
inferred← citeshttps://doi.org/10.1007/bf02764716openalex-snapshot
Acyclic colorings of planar graphs
inferred← citeshttps://doi.org/10.1007/bfb0066431openalex-snapshot
A survey of the reconstruction conjecture
inferred← citeshttps://doi.org/10.1007/bfb0066435openalex-snapshot
Generalized ramsey theory for graphs - a survey
inferred← citeshttps://doi.org/10.1007/bfb0067357openalex-snapshot
The number of partial order graphs
inferred← citeshttps://doi.org/10.1007/bfb0067364openalex-snapshot
Recent results on generalized Ramsey theory for graphs
inferred← citeshttps://doi.org/10.1007/bfb0067365openalex-snapshot
Line graphs of triangleless graphs and iterated clique graphs
inferred← citeshttps://doi.org/10.1007/s00454-012-9403-yopenalex-snapshot
On ≤k-Edges, Crossings, and Halving Lines of Geometric Drawings of K n
inferred← citeshttps://doi.org/10.1007/s10878-011-9388-0openalex-snapshot
A Nordhaus-Gaddum-type result for the induced path number
inferred← citeshttps://doi.org/10.1016/0012-365x(73)90075-7openalex-snapshot
Further characterizations of cubic lattice graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(73)90168-4openalex-snapshot
Graphs with valency k, edge connectivity k, chromatic index k + 1 and arbitrary girth
inferred← citeshttps://doi.org/10.1016/0012-365x(76)90057-1openalex-snapshot
Extremal edge problems for graphs with given hyperoctahedral automorphism group
inferred← citeshttps://doi.org/10.1016/0012-365x(77)90049-8openalex-snapshot
Frequency partitions: forcibly pancyclic and forcibly nonhamiltonian degree sequences
inferred← citeshttps://doi.org/10.1016/0012-365x(87)90142-7openalex-snapshot
Some parameters of graph and its complement
inferred← citeshttps://doi.org/10.1016/0012-365x(94)00204-vopenalex-snapshot
On graphs whose second largest eigenvalue does not exceed (√5−1)2
inferred← citeshttps://doi.org/10.1016/0095-8956(72)90064-0openalex-snapshot
The number of partially ordered sets
inferred← citeshttps://doi.org/10.1016/0095-8956(74)90042-2openalex-snapshot
Frequency sequences in graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(74)90061-6openalex-snapshot
Sufficient conditions for a graph to be Hamiltonian
inferred← citeshttps://doi.org/10.1016/0095-8956(74)90097-5openalex-snapshot
Inequalities for the chromatic numbers of graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(76)90006-xopenalex-snapshot
A polynomial dual of partitions
inferred← citeshttps://doi.org/10.1016/0095-8956(77)90049-1openalex-snapshot
Comparability graphs and a new matroid
inferred← citeshttps://doi.org/10.1016/0095-8956(77)90069-7openalex-snapshot
The Chartrand-Schuster conjecture: Graphs with unique distance trees are regular
inferred← citeshttps://doi.org/10.1016/0095-8956(80)90041-6openalex-snapshot
Optimal crossing-free Hamiltonian circuit drawings of Kn
inferred← citeshttps://doi.org/10.1016/0095-8956(91)90096-3openalex-snapshot
On graphs with exactly one eigenvalue less than −1
inferred← citeshttps://doi.org/10.1016/0167-6377(95)00010-hopenalex-snapshot
NETPAD: An interactive graphics system for network modeling and optimization
inferred← citeshttps://doi.org/10.1016/b978-0-08-040806-4.50021-6openalex-snapshot
NETPAD: AN INTERACTIVE GRAPHICS SYSTEM FOR NETWORK MODELING AND OPTIMIZATION
inferred← citeshttps://doi.org/10.1016/j.aim.2013.01.005openalex-snapshot
Hamilton decompositions of regular expanders: A proof of Kelly’s conjecture for large tournaments
inferred← citeshttps://doi.org/10.1016/j.aml.2011.01.011openalex-snapshot
Nordhaus–Gaddum bounds for total domination
inferred← citeshttps://doi.org/10.1016/j.dam.2011.11.031openalex-snapshot
Multiple factor Nordhaus–Gaddum type results for domination and total domination
inferred← citeshttps://doi.org/10.1016/j.dam.2011.12.018openalex-snapshot
A survey of Nordhaus–Gaddum type relations
inferred← citeshttps://doi.org/10.1016/j.dam.2017.04.016openalex-snapshot
Improving a Nordhaus–Gaddum type bound for total domination using an algorithm involving vertex disjoint stars
inferred← citeshttps://doi.org/10.1016/j.dam.2019.12.006openalex-snapshot
Some local–global phenomena in locally finite graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.01.029openalex-snapshot
On the edge-connectivity of the square of a graph
inferred← citeshttps://doi.org/10.1016/j.dam.2025.04.034openalex-snapshot
Nordhaus–Gaddum decompositions for group coloring and DP coloring
inferred← citeshttps://doi.org/10.1016/j.disc.2007.11.023openalex-snapshot
The crossing number of K1,m,n
inferred← citeshttps://doi.org/10.1016/j.disc.2008.04.052openalex-snapshot
Nordhaus–Gaddum inequalities for the fractional and circular chromatic numbers
inferred← citeshttps://doi.org/10.1016/j.disc.2012.11.025openalex-snapshot
Generalizations of Dirac’s theorem in Hamiltonian graph theory—A survey
inferred← citeshttps://doi.org/10.1016/j.disc.2016.10.014openalex-snapshot
Hamiltonian paths in spanning subgraphs of line graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2023.113392openalex-snapshot
Extremal decompositions for Nordhaus-Gaddum theorems
inferred← citeshttps://doi.org/10.1016/j.jctb.2011.10.005openalex-snapshot
Edge-disjoint Hamilton cycles in graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2013.10.006openalex-snapshot
Hamilton decompositions of regular expanders: Applications
inferred← citeshttps://doi.org/10.1016/j.jctb.2015.12.003openalex-snapshot
Solution to a problem of Bollobás and Häggkvist on Hamilton cycles in regular graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2016.06.001openalex-snapshot
Counting and packing Hamilton cycles in dense graphs and oriented graphs
inferred← citeshttps://doi.org/10.1016/j.sysconle.2024.105844openalex-snapshot
Resilient distributed averaging: Adversary detection and topological insights
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)90031-5openalex-snapshot
A bibliography on chromatic polynomials
inferred← citeshttps://doi.org/10.1016/s0378-3758(98)00132-3openalex-snapshot
Chessboard graphs, related designs, and domination parameters
inferred← citeshttps://doi.org/10.1142/s0129626420400058openalex-snapshot
The Connectivity of a Bipartite Graph and Its Bipartite Complementary Graph
inferred← citeshttps://doi.org/10.1186/s13040-014-0029-xopenalex-snapshot
Motif mining based on network space compression
inferred← citeshttps://doi.org/10.1201/b16113-53openalex-snapshot
Minimum Rank, Maximum Nullity and Zero Forcing Number of Graphs
inferred← citeshttps://doi.org/10.5860/choice.41-2860openalex-snapshot
Topics in graph automorphisms and reconstruction
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.