On the public citation graph

Triangulating 3-Colored Graphs

0 signed · 44 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.1002/net.3230210104openalex-snapshot
Efficient algorithms for inferring evolutionary trees
inferredcites →https://doi.org/10.1007/3-540-55719-9_80openalex-snapshot
Two strikes against perfect phylogeny
inferredcites →https://doi.org/10.1007/bf00275985openalex-snapshot
When are two qualitative taxonomic characters compatible?
inferredcites →https://doi.org/10.1016/0012-365x(74)90002-8openalex-snapshot
A characterisation of rigid circuit graphs
inferredcites →https://doi.org/10.1016/0025-5564(86)90161-6openalex-snapshot
The computational complexity of inferring rooted phylogenies by parsimony
inferredcites →https://doi.org/10.1016/0771-050x(80)90036-4openalex-snapshot
Algorithmic graph theory and perfect graphs
inferredcites →https://doi.org/10.1016/s0022-5193(87)80263-1openalex-snapshot
Computational complexity of inferring phylogenies from chromosome inversion data
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0196-8858(82)80004-3openalex-snapshot
The steiner problem in phylogeny is NP-complete
inferredcites →https://doi.org/10.1093/sysbio/35.2.224openalex-snapshot
Computational Complexity of Inferring Phylogenies by Compatibility
inferredcites →https://doi.org/10.1109/fscs.1990.89555openalex-snapshot
Inferring evolutionary history from DNA sequences
inferredcites →https://doi.org/10.1137/0608024openalex-snapshot
Complexity of Finding Embeddings in a k -Tree
inferredcites →https://doi.org/10.2307/2413432openalex-snapshot
Computational Complexity of Inferring Phylogenies by Compatibility
inferredcites →https://doi.org/10.5555/313559.313635openalex-snapshot
Triangulating vertex 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/aama.1994.1009openalex-snapshot
On the Complexity of DNA Physical Mapping
inferred← citeshttps://doi.org/10.1007/3-540-57899-4_41openalex-snapshot
Algorithms and complexity of sandwich problems in graphs (extended abstract)
inferred← citeshttps://doi.org/10.1007/3-540-60084-1_65openalex-snapshot
Intervalizing k-colored graphs
inferred← citeshttps://doi.org/10.1007/3-540-60922-9_49openalex-snapshot
Hypothesis testing in perfect phylogeny for a bounded number of characters
inferred← citeshttps://doi.org/10.1007/3-540-61440-0_168openalex-snapshot
A polynomial-time algorithm for near-perfect phylogeny
inferred← citeshttps://doi.org/10.1007/978-1-4613-0255-1_6openalex-snapshot
The Perfect Phylogeny Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-21458-5_13openalex-snapshot
Unique Perfect Phylogeny Is NP-Hard
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/0166-218x(94)90028-0openalex-snapshot
References
inferred← citeshttps://doi.org/10.1016/j.dam.2011.04.011openalex-snapshot
Acyclic and star colorings of cographs
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/j.tcs.2012.12.048openalex-snapshot
Unique perfect phylogeny is intractable
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.1109/sfcs.1993.366873openalex-snapshot
A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed
inferred← citeshttps://doi.org/10.1137/0406023openalex-snapshot
Triangulating Three-Colored Graphs in Linear Time and Linear Space
inferred← citeshttps://doi.org/10.1137/1.9781611973099.138openalex-snapshot
Subexponential Parameterized Algorithm for Minimum Fill-in
inferred← citeshttps://doi.org/10.1137/11085390xopenalex-snapshot
Subexponential Parameterized Algorithm for Minimum Fill-In
inferred← citeshttps://doi.org/10.1137/s0097539791222171openalex-snapshot
Inferring Evolutionary History From DNA Sequences
inferred← citeshttps://doi.org/10.1137/s0097539793244587openalex-snapshot
A Polynomial-Time Algorithm For the Perfect Phylogeny Problem When the Number of Character States is Fixed
inferred← citeshttps://doi.org/10.1137/s0097539796324636openalex-snapshot
Constructing Evolutionary Trees in the Presence of Polymorphic Characters
inferred← citeshttps://doi.org/10.1137/s0097539799350839openalex-snapshot
A Polynomial-Time Algorithm for Near-Perfect Phylogeny
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.48550/arxiv.1011.5737openalex-snapshot
Unique perfect phylogeny is NP-hard
inferred← citeshttps://doi.org/10.5555/2095116.2095254openalex-snapshot
Subexponential parameterized algorithm for minimum fill-in
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.