On the public citation graph

Detecting an Odd Hole

https://doi.org/10.1145/3375720
0 signed · 34 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/jgt.v48:2openalex-snapshot
inferredcites →https://doi.org/10.1006/jctb.1999.1932openalex-snapshot
Decomposition of Balanced Matrices
inferredcites →https://doi.org/10.1007/bf01582135openalex-snapshot
Testing balancedness and perfection of linear matrices
inferredcites →https://doi.org/10.1007/s00493-005-0012-8openalex-snapshot
Recognizing Berge Graphs
inferredcites →https://doi.org/10.1016/0012-365x(91)90098-mopenalex-snapshot
On the complexity of testing for odd holes and induced odd paths
inferredcites →https://doi.org/10.1016/0012-365x(92)90357-lopenalex-snapshot
Corrigendum
inferredcites →https://doi.org/10.1016/j.jctb.2013.07.005openalex-snapshot
Detecting an induced net subdivision
inferredcites →https://doi.org/10.1016/j.jctb.2015.10.002openalex-snapshot
Induced subgraphs of graphs with large chromatic number. I. Odd holes
inferredcites →https://doi.org/10.1137/060672613openalex-snapshot
Detecting a Theta or a Prism
inferredcites →https://doi.org/10.4007/annals.2006.164.51openalex-snapshot
The strong perfect graph theorem
inferredcites →https://doi.org/10.4064/am-19-3-4-413-441openalex-snapshot
Problems from the world surrounding perfect graphs

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.22601openalex-snapshot
A survey of χ‐boundedness
inferred← citeshttps://doi.org/10.1002/jgt.22748openalex-snapshot
Finding a shortest even hole in polynomial time
inferred← citeshttps://doi.org/10.1007/978-3-030-75242-2_11openalex-snapshot
FPT and Kernelization Algorithms for the Induced Tree Problem
inferred← citeshttps://doi.org/10.1007/s00493-020-4301-zopenalex-snapshot
Detecting a Long Odd Hole
inferred← citeshttps://doi.org/10.1016/j.dam.2019.05.019openalex-snapshot
On some graph classes related to perfect graphs: A survey
inferred← citeshttps://doi.org/10.1016/j.dam.2021.02.040openalex-snapshot
Polyhedral properties of the induced cluster subgraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2024.05.044openalex-snapshot
Shortest odd paths in undirected graphs with conservative weight functions
inferred← citeshttps://doi.org/10.1016/j.dam.2025.12.042openalex-snapshot
Thick Forests
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114383openalex-snapshot
The sandwich problem for odd-hole-free and even-hole-free graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2024.114388openalex-snapshot
Even pairs in Berge graphs with no balanced skew-partitions
inferred← citeshttps://doi.org/10.1016/j.ejc.2022.103537openalex-snapshot
Detecting a long even hole
inferred← citeshttps://doi.org/10.1016/j.ic.2024.105227openalex-snapshot
Blazing a trail via matrix multiplications: A faster algorithm for non-shortest induced paths
inferred← citeshttps://doi.org/10.1016/j.ic.2026.105448openalex-snapshot
Improved algorithms for perfect graphs and odd holes
inferred← citeshttps://doi.org/10.1080/09728600.2023.2282105openalex-snapshot
First-order logic with metric betweenness – the case of non-definability of some graph classes
inferred← citeshttps://doi.org/10.1137/1.9781611977073.61openalex-snapshot
Polynomial-time algorithm for Maximum Independent Set in bounded-degree graphs with no long induced claws
inferred← citeshttps://doi.org/10.1137/22m1530410openalex-snapshot
A Sum of Squares Characterization of Perfect Graphs
inferred← citeshttps://doi.org/10.1137/23m158156xopenalex-snapshot
Odd Paths, Cycles, and \(T\)-Joins: Connections and Algorithms
inferred← citeshttps://doi.org/10.1145/3357713.3384235openalex-snapshot
Three-in-a-tree in near linear time
inferred← citeshttps://doi.org/10.1145/3447869openalex-snapshot
Finding a Shortest Odd Hole
inferred← citeshttps://doi.org/10.1145/3717823.3718109openalex-snapshot
Disjoint Paths Problem with Group-Expressable Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.2110.12710openalex-snapshot
On the chromatic number of a family of odd hole free graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2312.11876openalex-snapshot
On recognition algorithms and structure of graphs with restricted induced cycles
inferred← citeshttps://doi.org/10.70675/42e4b45bzcf92z4138zb61bze20049651147openalex-snapshot
Width Parameters on Even-Hole-Free 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.