On the public citation graph

Boxicity of line graphs

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.
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/978-0-8176-4842-8_3openalex-snapshot
A Combinatorial Problem in Geometry
inferredcites →https://doi.org/10.1007/978-3-642-14031-0_3openalex-snapshot
Boxicity and Poset Dimension
inferredcites →https://doi.org/10.1007/bf01896428openalex-snapshot
Minimal scrambling sets of simple orders
inferredcites →https://doi.org/10.1007/s00373-010-0962-5openalex-snapshot
Boxicity of Leaf Powers
inferredcites →https://doi.org/10.1007/s00373-010-1002-1openalex-snapshot
Boxicity of Circular Arc Graphs
inferredcites →https://doi.org/10.1007/s00373-011-1017-2openalex-snapshot
Chordal Bipartite Graphs with High Boxicity
inferredcites →https://doi.org/10.1007/s00453-008-9163-5openalex-snapshot
Geometric Representation of Graphs in Low Dimension Using Axis Parallel Boxes
inferredcites →https://doi.org/10.1016/0012-365x(75)90078-3openalex-snapshot
On a combinatorial problem in geometry
inferredcites →https://doi.org/10.1016/0095-8956(86)90061-4openalex-snapshot
Interval representations of planar graphs
inferredcites →https://doi.org/10.1016/0166-218x(83)90077-xopenalex-snapshot
Computing the boxicity of a graph by covering its complement by cointerval graphs
inferredcites →https://doi.org/10.1016/0166-218x(94)90143-0openalex-snapshot
A special planar satisfiability problem and a consequence of its NP-completeness
inferredcites →https://doi.org/10.1016/j.disc.2007.10.011openalex-snapshot
The cubicity of hypercube graphs
inferredcites →https://doi.org/10.1016/j.disc.2008.06.003openalex-snapshot
Cubicity, boxicity, and vertex cover
inferredcites →https://doi.org/10.1016/j.disc.2010.01.020openalex-snapshot
Boxicity and cubicity of asteroidal triple free graphs
inferredcites →https://doi.org/10.1016/j.ejc.2008.10.003openalex-snapshot
Boxicity of graphs with bounded degree
inferredcites →https://doi.org/10.1016/j.jctb.2006.12.004openalex-snapshot
Boxicity and treewidth
inferredcites →https://doi.org/10.1016/j.jctb.2007.08.002openalex-snapshot
Boxicity and maximum degree
inferredcites →https://doi.org/10.1137/0603036openalex-snapshot
The Complexity of the Partial Order Dimension Problem

What points at this work

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

inferred← citeshttps://doi.org/10.1002/jcd.21802openalex-snapshot
Perfect and nearly perfect separation dimension of complete and random graphs
inferred← citeshttps://doi.org/10.1002/jgt.22236openalex-snapshot
Separation dimension and sparsity
inferred← citeshttps://doi.org/10.1007/978-3-030-60440-0_13openalex-snapshot
Plattenbauten: Touching Rectangles in Space
inferred← citeshttps://doi.org/10.1007/978-3-031-49272-3_19openalex-snapshot
Boxicity and Interval-Orders: Petersen and the Complements of Line Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-12340-0_7openalex-snapshot
Boxicity and Separation Dimension
inferred← citeshttps://doi.org/10.1007/978-88-7642-475-5_38openalex-snapshot
Boxicity and cubicity of product graphs
inferred← citeshttps://doi.org/10.1007/s00453-015-0050-6openalex-snapshot
Separation Dimension of Graphs and Hypergraphs
inferred← citeshttps://doi.org/10.1007/s13226-025-00893-4openalex-snapshot
A survey on the boxicity and cubicity of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2025.01.038openalex-snapshot
Bounds for boxicity of circular clique graphs and zero-divisor graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2022.113085openalex-snapshot
Local boxicity and maximum degree
inferred← citeshttps://doi.org/10.1016/j.ejc.2013.06.021openalex-snapshot
Cubicity, degeneracy, and crossing number
inferred← citeshttps://doi.org/10.1016/j.ejc.2015.02.013openalex-snapshot
Boxicity and cubicity of product graphs
inferred← citeshttps://doi.org/10.1017/s0305004119000525openalex-snapshot
Separation dimension and degree
inferred← citeshttps://doi.org/10.1093/comnet/cnv023openalex-snapshot
Revisiting interval graphs for Network Science
inferred← citeshttps://doi.org/10.1137/120861795openalex-snapshot
Representing a Cubic Graph as the Intersection Graph of Axis-Parallel Boxes in Three Dimensions
inferred← citeshttps://doi.org/10.1137/140973013openalex-snapshot
Separation Dimension of Bounded Degree Graphs
inferred← citeshttps://doi.org/10.1137/23m160116xopenalex-snapshot
Plattenbauten: Touching Rectangles in Space
inferred← citeshttps://doi.org/10.25560/28624openalex-snapshot
On the topology Of network fine structures
inferred← citeshttps://doi.org/10.48550/arxiv.2001.01883openalex-snapshot
Boxicity of Circulant Graph $G_k^d$
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.