On the public citation graph
Chromatically Unique Multibridge Graphs
0 signed · 22 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 this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/jgt.3190160507openalex-snapshot
Chromatic polynomials, polygon trees, and outerplanar graphs
inferredcites →https://doi.org/10.1002/jgt.3190170312openalex-snapshot
On chromatic uniqueness of two infinite families of graphs
inferredcites →https://doi.org/10.1007/bf01787578openalex-snapshot
The search for chromatically unique graphs
inferredcites →https://doi.org/10.1016/0012-365x(78)90012-2openalex-snapshot
Chromatic uniqueness of the generalized θ-graph
inferredcites →https://doi.org/10.1016/0012-365x(93)e0091-hopenalex-snapshot
The chromaticity of s-bridge graphs and related graphs
inferredcites →https://doi.org/10.1016/0012-365x(94)00355-mopenalex-snapshot
Chromaticity of series-parallel graphs
inferredcites →https://doi.org/10.1016/0012-365x(94)90033-7openalex-snapshot
Classes of chromatically equivalent graphs and polygon trees
inferredcites →https://doi.org/10.1016/0022-247x(65)90125-3openalex-snapshot
Topology of series-parallel networks
inferredcites →https://doi.org/10.1016/s0012-365x(96)00269-5openalex-snapshot
The search for chromatically unique graphs — II
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00220-019-03473-wopenalex-snapshot
$$L^p$$ Norms and Support of Eigenfunctions on Graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2009.09.003openalex-snapshot
Series–parallel chromatic hypergraphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.09.021openalex-snapshot
Coloring K k -free intersection graphs of geometric objects in the plane
inferred← citeshttps://doi.org/10.1063/1.4932483openalex-snapshot
Chromaticity of 6-bridge graph θ(3,3,3,b,c,d)
inferred← citeshttps://doi.org/10.1063/1.4995832openalex-snapshot
Chromatic uniqueness of 6-bridge graph θ(3,3,b,c,c,c)
inferred← citeshttps://doi.org/10.1063/5.0330845openalex-snapshot
Chromaticity of a type of 6-bridge graphs
inferred← citeshttps://doi.org/10.1088/1742-6596/890/1/012116openalex-snapshot
The chromaticity of a family of 6-bridge graph
inferred← citeshttps://doi.org/10.1109/iacsit-sc.2009.125openalex-snapshot
A Family of Chromatically Unique k-Bridge Graphs
inferred← citeshttps://doi.org/10.1109/inmic.2006.358144openalex-snapshot
New Time Series Predictability Metrics for Nearest Neighbor Based Forecasting
inferred← citeshttps://doi.org/10.1142/s0218216518400072openalex-snapshot
Patterns in Khovanov link and chromatic graph homology
inferred← citeshttps://doi.org/10.22199/issn.0717-6279-2933openalex-snapshot
A new family of chromatically unique 6-bridge graph
inferred← citeshttps://doi.org/10.24247/ijmcaraug20183openalex-snapshot
A Note on Chromaticity of Multibridge Graphs
inferred← citeshttps://doi.org/10.5614/ejgta.2016.4.1.6openalex-snapshot
Chromatically unique 6-bridge graph theta(a,a,a,b,b,c)
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.