Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs [PDF]
Discrete Mathematics, 2003 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Terry Mckee
exaly +4 more sources
Strongly orderable graphs A common generalization of strongly chordal and chordal bipartite graphs [PDF]
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 +3 more sources
A characterization of strongly chordal graphs [PDF]
Discrete Mathematics, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Mirka Miller, Elias Dahlhaus
exaly +4 more sources
Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs [PDF]
Discrete Applied Mathematics, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ryuhei Uehara
exaly +4 more sources
Maxclique and Unit Disk Characterizations of Strongly Chordal Graphs [PDF]
Discussiones Mathematicae Graph Theory, 2014 Maxcliques (maximal complete subgraphs) and unit disks (closed neighborhoods of vertices) sometime play almost interchangeable roles in graph theory. For instance, interchanging them makes two existing characterizations of chordal graphs into two new ...
Caria Pablo De, McKee Terry A.
doaj +6 more sources
On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs [PDF]
Theoretical Computer Science, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
C M H de Figueiredo +2 more
exaly +4 more sources
Cycle Extendability of Hamiltonian Strongly Chordal Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2021 14 pages, 6 figures.
Wenjun Li
exaly +4 more sources
On Strongly Chordal Graphs That Are Not Leaf Powers [PDF]
Lecture Notes in Computer Science, 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 that uv is an edge if and only if the distance between u and v in T is at most k.
Manuel Lafond, Lafond Manuel
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 ...
Anil Maheshwari +2 more
exaly +4 more sources
Further results on Hendry's Conjecture [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 Recently, a conjecture due to Hendry was disproved which stated that every Hamiltonian chordal graph is cycle extendible. Here we further explore the conjecture, showing that it fails to hold even when a number of extra conditions are imposed.
Manuel Lafond +2 more
doaj +1 more source