Results 21 to 30 of about 4,514 (260)
Lombardi drawings of knots and links
Journal of Computational Geometry, 2019 Knot and link diagrams are projections of one or more 3-dimensional simple closed curves into $\mathbb{R}^2$, such that no more than two points project to the same point in $\mathbb{R}^2$.
Philipp Kindermann +5 more
doaj +1 more source
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
On the Cubicity of AT-Free Graphs and Circular-Arc Graphs [PDF]
, 2009 9 pages, 0 ...
L. Sunil Chandran +2 more
openaire +2 more sources
The Topological Connectivity of the Independence Complex of Circular-Arc Graphs
Universal Journal of Mathematics and Applications, 2019 Let us denoted the topological connectivity of a simplicial complex $C$ plus 2 by $\eta(C)$. Let $\psi$ be a function from class of graphs to the set of positive integers together with $\infty$. Suppose $\psi$ satisfies the following properties: \newline
Yousef Abd Algani
doaj +1 more source
Circular arc bigraphs and their Helly subclass [PDF]
, 2021 Orientadora: Marina GroshausCoorientador: André Luiz Pires GuedesTese (doutorado) - Universidade Federal do Paraná, Setor de Tecnologia, Programa de Pós-Graduação em Informática. Defesa : Curitiba, 09/06/2021Inclui referências: p.
Kolberg, Fabricio Schiavon, 1990-
core
On powers of circular arc graphs and proper circular arc graphs
Discrete Applied Mathematics, 1996 Let \(\mathcal K\) denote the class of circular arc graphs. The author gives a new proof that if a graph \(G\in {\mathcal K}\), then the power \(G^n\in {\mathcal K}\) for any positive integer \(n\). Moreover, he proves that if \(G^n\in {\mathcal K}\) then \(G^{n+2}\in {\mathcal K}\) and if \(\text{diam}(G^n)\geq 4\) then \(G^n\in {\mathcal K}\) implies
openaire +2 more sources
Self-clique Helly circular-arc graphs
, 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
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 +1 more source
Structure theorems for some circular-arc graphs
, 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
On the hyperbolicity constant of circular-arc graphs [PDF]
Discrete Applied Mathematics, 2019 arXiv admin note: text overlap with arXiv:1501.02288 by other ...
Rosalío Reyes +3 more
openaire +2 more sources