On the public citation graph

Combinatorics, Graph Theory, Algorithms and Applications

https://doi.org/10.1142/2443
0 signed · 23 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.
Claim with ORCID
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.
See reference health

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/jgt.22373openalex-snapshot
Highly edge‐connected factors using given lists on degrees
inferred← citeshttps://doi.org/10.1006/jctb.1998.1883openalex-snapshot
Decompositions to Degree-Constrainded Subgraphs Are Simply Reducible to Edge-Colorings
inferred← citeshttps://doi.org/10.1007/978-3-642-19391-0_9openalex-snapshot
On the General Coloring Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-59204-5_14openalex-snapshot
Embedding Graphs into Larger Graphs: Results, Methods, and Problems
inferred← citeshttps://doi.org/10.1007/978-981-19-9307-7_16openalex-snapshot
Some Parameters of Restricted Super Line Graphs
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00051-wopenalex-snapshot
Number of 4-kings in bipartite tournaments with no 3-kings
inferred← citeshttps://doi.org/10.1016/j.disc.2007.11.069openalex-snapshot
Path-comprehensive and vertex-pancyclic properties of super line graph L2(G)
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.2008.08.012openalex-snapshot
New results on chromatic index critical graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2012.02.024openalex-snapshot
On 3-connected hamiltonian line graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112177openalex-snapshot
On the line graph of a graph with diameter 2
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112745openalex-snapshot
On the extended Clark-Wormold Hamiltonian-like index problem
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.04.013openalex-snapshot
Two models of two-dimensional bandwidth problems
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00244-0openalex-snapshot
The number of kings in a multipartite tournament
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00269-5openalex-snapshot
The search for chromatically unique graphs — II
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)00152-0openalex-snapshot
Automorphism groups and isomorphisms of Cayley digraphs
inferred← citeshttps://doi.org/10.1016/s0012-365x(97)90031-5openalex-snapshot
A bibliography on chromatic polynomials
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00068-2openalex-snapshot
Bounding the bandwidths for graphs
inferred← citeshttps://doi.org/10.1017/s000497271100219xopenalex-snapshot
A NOTE ON EDGE-CONNECTIVITY OF THE CARTESIAN PRODUCT OF GRAPHS
inferred← citeshttps://doi.org/10.1080/09720529.2004.10697988openalex-snapshot
Diameter of path graphs
inferred← citeshttps://doi.org/10.1201/9780203885765.ch2openalex-snapshot
Automorphism groups of Cayley digraphs
inferred← citeshttps://doi.org/10.1360/ssm-2019-0266openalex-snapshot
Optimization of spanning tree stretch and congestion for graphs
inferred← citeshttps://doi.org/10.37236/6848openalex-snapshot
Measures of Edge-Uncolorability of Cubic Graphs
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.