On the public citation graph

Triangulating Three-Colored Graphs in Linear Time and Linear Space

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 this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-55210-3_201openalex-snapshot
A simple linear time algorithm for triangulating three-colored graphs
inferredcites →https://doi.org/10.1016/0012-365x(74)90002-8openalex-snapshot
A characterisation of rigid circuit graphs
inferredcites →https://doi.org/10.1016/0771-050x(80)90036-4openalex-snapshot
Algorithmic graph theory and perfect graphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)x7180-4openalex-snapshot
Planar Graphs: Theory and Algorithms
inferredcites →https://doi.org/10.1137/0405019openalex-snapshot
Triangulating 3-Colored Graphs

What points at this work

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

inferred← citeshttps://doi.org/10.1006/jagm.1994.1018openalex-snapshot
Tree Compatibility and Inferring Evolutionary History
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_65openalex-snapshot
Intervalizing k-colored graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-04241-6_18openalex-snapshot
Generalizing the Four Gamete Condition and Splits Equivalence Theorem: Perfect Phylogeny on Three State Characters
inferred← citeshttps://doi.org/10.1007/978-3-642-45043-3_17openalex-snapshot
Completing Colored Graphs to Meet a Target Property
inferred← citeshttps://doi.org/10.1016/j.dam.2017.01.021openalex-snapshot
Completing colored graphs to meet a target property
inferred← citeshttps://doi.org/10.1016/j.dam.2019.05.017openalex-snapshot
Some completion problems for graphs without chordless cycles of prescribed lengths
inferred← citeshttps://doi.org/10.1016/j.dam.2022.03.027openalex-snapshot
Bipartite completion of colored graphs avoiding chordless cycles of given lengths
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00057-1openalex-snapshot
On intervalizing k-colored graphs for DNA physical mapping
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00342-9openalex-snapshot
The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs
inferred← citeshttps://doi.org/10.1080/0028825x.1993.10419501openalex-snapshot
Constructing phylogenetic trees efficiently using compatibility criteria
inferred← citeshttps://doi.org/10.1137/090776305openalex-snapshot
Generalizing the Splits Equivalence Theorem and Four Gamete Condition: Perfect Phylogeny on Three-State Characters
inferred← citeshttps://doi.org/10.1137/s0097539791222171openalex-snapshot
Inferring Evolutionary History From DNA Sequences
inferred← citeshttps://doi.org/10.1137/s0097539796324636openalex-snapshot
Constructing Evolutionary Trees in the Presence of Polymorphic Characters
inferred← citeshttps://doi.org/10.1137/s0895480192229273openalex-snapshot
Triangulating Vertex-Colored Graphs
inferred← citeshttps://doi.org/10.1145/237814.237867openalex-snapshot
Constructing evolutionary trees in the presence of polymorphic characters
inferred← citeshttps://doi.org/10.4000/msh.2858openalex-snapshot
Graphes d'arches
inferred← citeshttps://doi.org/10.5555/313559.313635openalex-snapshot
Triangulating vertex colored graphs
inferred← citeshttps://doi.org/10.5555/313559.313837openalex-snapshot
Tree compatibility and inferring evolutionary history
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.