Results 1 to 10 of about 3,758 (105)
On strongly chordal graphs that are not leaf powers [PDF]
, 2017 A common task in phylogenetics is to find an evolutionary tree representing proximity relationships between species. This motivates the notion of leaf powers: a graph G = (V, E) is a leaf power if there exist a tree T on leafset V and a threshold k such ...
A Brandstädt +18 more
core +2 more sources
A characterization of strongly chordal graphs
Discrete Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Elias Dahlhaus, Mirka Miller
exaly +3 more sources
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs
Discrete Applied Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ryuhei Uehara
exaly +2 more sources
Strongly orderable graphs A common generalization of strongly chordal and chordal bipartite graphs
Discrete Applied Mathematics, 2000 For a graph \(G = (V,E)\) a linear ordering \(\sigma\) of the vertices is called a strong ordering of \(G\) if the following property is fulfilled: if \(ab, ac, bd \in E\), \(a
Feodor F Dragan
exaly +2 more sources
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs
Theoretical Computer Science, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
C M H de Figueiredo +2 more
exaly +3 more sources
Rainbow domination and related problems on strongly chordal graphs
Discrete Applied Mathematics, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gérard J Chang
exaly +3 more sources
A linear-time algorithm for semitotal domination in strongly chordal graphs
Discrete Applied Mathematics, 2023 In a graph $G=(V,E)$ with no isolated vertex, a dominating set $D \subseteq V$, is called a semitotal dominating set if for every vertex $u \in D$ there is another vertex $v \in D$, such that distance between $u$ and $v$ is at most two in $G$. Given a graph $G=(V,E)$ without isolated vertices, the Minimum Semitotal Domination problem is to find a ...
Vikash Tripathi +2 more
exaly +4 more sources
Cycle Extendability of Hamiltonian Strongly Chordal Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2021 14 pages, 6 figures.
Guozhen Rong +3 more
openaire +3 more sources
Semi-dynamic algorithms for strongly chordal graphs [PDF]
Discrete Mathematics, Algorithms and Applications, 2020 Within the broad ambit of algorithm design, the study of dynamic graph algorithms continues to be a thriving area of research. Commensurate with this interest is an extensive literature on the topic. Not surprisingly, dynamic algorithms for all varieties of shortest path problems, in view of their practical importance, occupy a preeminent position ...
Md. Zamilur Rahman, Asish Mukhopadhyay
openaire +2 more sources
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