{"paper":{"title":"L-Graphs and Monotone L-Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Abu Reyan Ahmed, Alon Efrat, Eric Welch, Felice De Luca, Jixian Li, Md Iqbal Hossain, Sabin Devkota, Sammi Abida Salma, Stephen Kobourov","submitted_at":"2017-03-05T01:41:08Z","abstract_excerpt":"In an $\\mathsf{L}$-embedding of a graph, each vertex is represented by an $\\mathsf{L}$-segment, and two segments intersect each other if and only if the corresponding vertices are adjacent in the graph. If the corner of each $\\mathsf{L}$-segment in an $\\mathsf{L}$-embedding lies on a straight line, we call it a monotone $\\mathsf{L}$-embedding. In this paper we give a full characterization of monotone $\\mathsf{L}$-embeddings by introducing a new class of graphs which we call \"non-jumping\" graphs. We show that a graph admits a monotone $\\mathsf{L}$-embedding if and only if the graph is a non-jum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.01544","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}