On the public citation graph
On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane
0 signed · 37 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.1016/0012-365x(85)90044-5openalex-snapshot
On the chromatic number of multiple interval graphs and overlap graphs
inferredcites →https://doi.org/10.1016/0012-365x(85)90045-7openalex-snapshot
Covering and coloring problems for relatives of intervals
inferredcites →https://doi.org/10.1016/0012-365x(93)90407-kopenalex-snapshot
Some combinatorial problems
inferredcites →https://doi.org/10.1016/c2013-0-10739-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0012-365x(00)00027-3openalex-snapshot
Colouring triangle-free intersection graphs of boxes on the plane
inferredcites →https://doi.org/10.1016/s0012-365x(02)00501-0openalex-snapshot
Bounds on the chromatic number of intersection graphs of sets in the plane
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1112/blms/26.2.132openalex-snapshot
A Ramsey-Type Result for Convex Sets
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.1007/978-3-540-77200-2_4openalex-snapshot
Erdős-Hajnal-type Results on Intersection Patterns of Geometric Objects
inferred← citeshttps://doi.org/10.1007/978-3-540-78773-0_64openalex-snapshot
Domination in Geometric Intersection Graphs
inferred← citeshttps://doi.org/10.1007/978-3-642-04128-0_12openalex-snapshot
Piercing Translates and Homothets of a Convex Body
inferred← citeshttps://doi.org/10.1007/978-3-642-35261-4_64openalex-snapshot
Beyond Homothetic Polygons: Recognition and Maximum Clique
inferred← citeshttps://doi.org/10.1007/s00453-010-9410-4openalex-snapshot
Piercing Translates and Homothets of a Convex Body
inferred← citeshttps://doi.org/10.1007/s00454-013-9534-9openalex-snapshot
Triangle-Free Geometric Intersection Graphs with Large Chromatic Number
inferred← citeshttps://doi.org/10.1007/s00454-014-9614-5openalex-snapshot
Coloring Intersection Graphs of Arc-Connected Sets in the Plane
inferred← citeshttps://doi.org/10.1007/s00493-014-2942-5openalex-snapshot
Coloring intersection graphs of x-monotone curves in the plane
inferred← citeshttps://doi.org/10.1007/s13366-011-0048-4openalex-snapshot
Coloring translates and homothets of a convex body
inferred← citeshttps://doi.org/10.1016/j.disc.2006.05.014openalex-snapshot
Transversal numbers of translates of a convex body
inferred← citeshttps://doi.org/10.1016/j.disc.2007.08.072openalex-snapshot
Coloring the complements of intersection graphs of geometric figures
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.1016/j.jfa.2025.111235openalex-snapshot
A view from above on JN p ( R n )
inferred← citeshttps://doi.org/10.1137/17m1157374openalex-snapshot
Outerstring Graphs are $\chi$-Bounded
inferred← citeshttps://doi.org/10.1145/1377676.1377735openalex-snapshot
Coloring k k -free intersection graphs of geometric objects in the plane
inferred← citeshttps://doi.org/10.1145/2582112.2582115openalex-snapshot
Outerstring graphs are χ-bounded
inferred← citeshttps://doi.org/10.20382/jocg.v7i1a1openalex-snapshot
Density of Range Capturing Hypergraphs
inferred← citeshttps://doi.org/10.4230/lipics.socg.2015.630openalex-snapshot
On-line Coloring between Two Lines
inferred← citeshttps://doi.org/10.48550/arxiv.1312.1678openalex-snapshot
Note on the number of edges in families with linear union-complexity
inferred← citeshttps://doi.org/10.5817/cz.muni.eurocomb23-018openalex-snapshot
Chromatic number of intersection graphs of segments with two slopes
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.