On the public citation graph
Two remarks on circular arc graphs
0 signed · 39 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.3190200312openalex-snapshot
Lexicographic orientation and representation algorithms for comparability graphs, proper circular arc graphs, and proper interval graphs
inferredcites →https://doi.org/10.1002/net.3230040407openalex-snapshot
Algorithms on circular‐arc graphs
inferredcites →https://doi.org/10.1006/jagm.1997.0868openalex-snapshot
AnO(m+nlogn) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs
inferredcites →https://doi.org/10.1007/s004939970003openalex-snapshot
List Homomorphisms and Circular Arc Graphs
inferredcites →https://doi.org/10.1016/0020-0190(87)90007-xopenalex-snapshot
Finding maximum cliques on circular-arc graphs
inferredcites →https://doi.org/10.1016/0020-0190(89)90220-2openalex-snapshot
An O(n log n + m log log n) maximum weight clique algorithm for circular-arc graphs
inferredcites →https://doi.org/10.1016/0041-1647(68)90016-6openalex-snapshot
Scheduling of traffic lights—A new approach
inferredcites →https://doi.org/10.1016/0095-8956(88)90038-xopenalex-snapshot
Circular-arc graphs with clique cover number two
inferredcites →https://doi.org/10.1016/0771-050x(80)90036-4openalex-snapshot
Algorithmic graph theory and perfect graphs
inferredcites →https://doi.org/10.1016/s0012-365x(76)80011-8openalex-snapshot
Characterization problems for graphs, partially ordered sets, lattices, and families of sets
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1137/0209001openalex-snapshot
An Efficient Test for Circular-Arc Graphs
inferredcites →https://doi.org/10.1137/0214018openalex-snapshot
Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
inferredcites →https://doi.org/10.1137/s0097539793260726openalex-snapshot
$O(M\cdot N)$ Algorithms for the Recognition and Isomorphism Problems on Circular-Arc Graphs
inferredcites →https://doi.org/10.1137/s0895480192242754openalex-snapshot
A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs
inferredcites →https://doi.org/10.2140/pjm.1971.39.535openalex-snapshot
Matrix characterizations of circular-arc 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.10073openalex-snapshot
Bi‐arc graphs and the complexity of list homomorphisms
inferred← citeshttps://doi.org/10.1002/jgt.20006openalex-snapshot
Interval bigraphs and circular arc graphs
inferred← citeshttps://doi.org/10.1002/jgt.21681openalex-snapshot
Circular‐Arc Bigraphs and Its Subclasses
inferred← citeshttps://doi.org/10.1002/jgt.22067openalex-snapshot
Partial Characterizations of 1‐Perfectly Orientable Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-06089-7_23openalex-snapshot
Intersection Dimension of Bipartite Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-53925-6_14openalex-snapshot
Recognizing Simple-Triangle Graphs by Restricted 2-Chain Subgraph Cover
inferred← citeshttps://doi.org/10.1007/978-3-319-71840-8_12openalex-snapshot
Lexicographic Orientation Algorithms
inferred← citeshttps://doi.org/10.1007/978-981-96-1090-7_23openalex-snapshot
A Characterization of Uniquely Representable Two-Directional Orthogonal Ray Graphs
inferred← citeshttps://doi.org/10.1007/s004939970003openalex-snapshot
List Homomorphisms and Circular Arc Graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2012.12.021openalex-snapshot
Structural results on circular-arc graphs and circle graphs: A survey and the main open problems
inferred← citeshttps://doi.org/10.1016/j.dam.2015.05.035openalex-snapshot
Ferrers dimension of grid intersection graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.11.004openalex-snapshot
Graphs and digraphs represented by intervals and circular arcs
inferred← citeshttps://doi.org/10.1016/j.dam.2017.02.001openalex-snapshot
Non-edge orientation and vertex ordering characterizations of some classes of bigraphs
inferred← citeshttps://doi.org/10.1016/j.dam.2019.10.028openalex-snapshot
Recognizing simple-triangle graphs by restricted 2-chain subgraph cover
inferred← citeshttps://doi.org/10.1016/j.disc.2004.02.022openalex-snapshot
A generalization of the theorem of Lekkerkerker and Boland
inferred← citeshttps://doi.org/10.1016/j.disc.2008.04.003openalex-snapshot
Characterizations and recognition of circular-arc graphs and subclasses: A survey
inferred← citeshttps://doi.org/10.1016/j.jctb.2006.01.001openalex-snapshot
Representation characterizations of chordal bipartite graphs
inferred← citeshttps://doi.org/10.1137/s0895480192242754openalex-snapshot
A Linear Algorithm for Maximum Weight Cliques in Proper Circular Arc Graphs
inferred← citeshttps://doi.org/10.2298/aadm160913020hopenalex-snapshot
Chordal, interval, and circular-arc product 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.