Results 21 to 30 of about 12,115 (251)
Polynomial kernels for edge modification problems towards block and strictly chordal graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe consider edge modification problems towards block and strictly chordal graphs, where one is given an undirected graph $G = (V,E)$ and an integer $k \in \mathbb{N}$ and seeks to edit (add or delete) at most $k$ edges from $G$ to obtain a block graph or
Maël Dumas +3 more
doaj +1 more source
On the Complexity of Finding a Sun in a Graph [PDF]
, 2010 The sun is the graph obtained from a cycle of length even and at least six by adding edges to make the even-indexed vertices pairwise adjacent. Suns play an important role in the study of strongly chordal graphs. A graph is chordal if it does not contain
Hoàng, Chính T.
core +2 more sources
SIAM Journal on Discrete Mathematics, 1994 The authors give a unified framework for characterizations of graphs which are dual (in the sense of hypergraphs) to chordal graphs, in terms of neighborhood and clique hypergraphs. By using the hypergraph approach in a systematical way, new results are obtained, a part of previous results are generalized, and some of the proofs are simplified.
Brandstadt, A. +3 more
openaire +3 more sources
Exploiting chordal structure in polynomial ideals: a Gr\"obner bases approach [PDF]
, 2016 Chordal structure and bounded treewidth allow for efficient computation in numerical linear algebra, graphical models, constraint satisfaction and many other areas.
Cifuentes, Diego, Parrilo, Pablo
core +2 more sources
Discrete Applied Mathematics, 2003 A graph \(G=(V, E)\) is a chordal probe graph if there exists a partition \(V=P\cup N\) with a stable set \(N\) and a completion \(E'\subseteq\{uv : u\not= v\in N\}\) such that the graph \((V, E\cup E')\) is a chordal graph. Chordal probe graphs generalize probe interval graphs introduced by P. Zhang; see also [\textit{F. R. McMorris, C.
Golumbic, Martin Charles +1 more
openaire +2 more sources
Algorithmic Aspects of Secure Connected Domination in Graphs
Discussiones Mathematicae Graph Theory, 2021 Let G = (V, E) be a simple, undirected and connected graph. A connected dominating set S ⊆ V is a secure connected dominating set of G, if for each u ∈ V \ S, there exists v ∈ S such that (u, v) ∈ E and the set (S \ {v}) ∪ {u} is a connected dominating ...
Kumar Jakkepalli Pavan +1 more
doaj +1 more source
Graph Extremities Defined by Search Algorithms
Algorithms, 2010 Graph search algorithms have exploited graph extremities, such as the leaves of a tree and the simplicial vertices of a chordal graph. Recently, several well-known graph search algorithms have been collectively expressed as two generic algorithms called ...
Jean-Paul Bordat +3 more
doaj +1 more source
Recognition of chordal graphs and cographs which are Cover-Incomparability graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceCover-Incomparability graphs (C-I graphs) are an interesting class of graphs from posets. A C-I graph is a graph from a poset $P=(V,\le)$ with vertex set $V$, and the edge-set is the union of edge sets of the cover graph and the incomparability graph of ...
Arun Anil, Manoj Changat
doaj +1 more source
Bipartite powers of k-chordal graphs [PDF]
, 2012 Let k be an integer and k \geq 3. A graph G is k-chordal if G does not have an induced cycle of length greater than k. From the definition it is clear that 3-chordal graphs are precisely the class of chordal graphs. Duchet proved that, for every positive
Chandran, L. Sunil, Mathew, Rogers
core +2 more sources
Journal of Combinatorial Theory, Series A, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Herzog, Jürgen +2 more
openaire +1 more source