Results 21 to 30 of about 1,554,742 (257)
Circular-arc Graph Coloring and Unrolling [PDF]
, 1998 The register periodic allocation problem is viewed as unrolling and coloring the underlying structure of circular-arc graph. The problem is to find relations between the unrolling degree and the chromatic number.
Eisenbeis, Christine +2 more
core +4 more sources
Deconstruction of Human Age-Related Cataract Capsules Defines Aging. [PDF]
Adv Sci (Weinh)We generate a comprehensive atlas of age‐related cataracts (ARC) at a single‐cell resolution, encompassing three disease states—mild cataract group (Mild), severe cortical cataract group (Severe_C), and severe nuclear cataract group (Severe_N). We find that ARC involves seven distinct lens capsule cell types, with notable differences in cellular ...
Tang Q +9 more
europepmc +2 more sources
Contact Graphs of Circular Arcs [PDF]
, 2015 We study representations of graphs by contacts of circular arcs, CCA-representations for short, where the vertices are interior-disjoint circular arcs in the plane and each edge is realized by an endpoint of one arc touching the interior of another. A graph is (2, k)-sparse if every s-vertex subgraph has at most \(2s-k\) edges, and (2, k)-tight if in ...
Md. Jawaherul Alam +6 more
openaire +4 more sources
Drawing planar graphs with circular arcs [PDF]
Discrete & Computational Geometry, 1999 The authors study the problem of drawing planar graphs with circular arcs, while maintaining good angular resolution and small drawing area. They show the following: (1) There is an \(n\)-vertex planar graph requiring area exponential in \(n\) for any drawing using single-circle arcs for edges and having good angular resolution. (2) Let \(d(v)\) be the
C. C. Cheng +3 more
openaire +3 more sources
Self-clique Helly circular-arc graphs [PDF]
, 2005 A clique in a graph is a complete subgraph maximal under inclusion. The clique graph of a graph is the intersection graph of its cliques. A graph is self-clique when it is isomorphic to its clique graph.
Bonomo, Flavia +2 more
core +1 more source
Structure theorems for some circular-arc graphs [PDF]
, 1974 A proper circular-arc graph is a graph that has an intersection model formed by a family of overlapping arcs on some circle in which no arc contains another.
Tucker, Alan
core +1 more source
Pathwidth of Circular-Arc Graphs [PDF]
, 2007 The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. Although pathwidth is a well-known and well-studied graph parameter, there are extremely few graph classes for which pathwidh is known to be tractable in polynomial time.
Karol Suchan, Ioan Todinca
openaire +2 more sources
Irredundancy in circular arc graphs
Discrete Applied Mathematics, 1993 An open neighbourhood of a vertex \(x\) in an undirected graph \(G\) is the set \(N(x)\) of all vertices adjacent to \(x\) in \(G\); its closed neighbourhood is \(N[x]=N(x) \cup \{x\}\). For a set \(S\) of vertices set \(N(S)=\bigcup_{x \in S}N(x)\) and \(N[S]=\bigcup_{x \in S} N[x]\). A subset \(X\) of the vertex set of \(G\) is called irredundant (or
Martin Charles Golumbic, Renu C. Laskar
openaire +2 more sources
Power Domination in Circular-Arc Graphs [PDF]
Algorithmica, 2011 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chung-Shou Liao, D. T. Lee
openaire +1 more source
On the Cubicity of AT-Free Graphs and Circular-Arc Graphs [PDF]
, 2009 9 pages, 0 ...
L. Sunil Chandran +2 more
openaire +3 more sources