Results 41 to 50 of about 946,691 (269)
Maxclique and Unit Disk Characterizations of Strongly Chordal Graphs
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 +1 more source
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.
Uehara, Ryuhei +2 more
openaire +1 more source
Intersection Graphs of Pseudosegments: Chordal Graphs
Journal of Graph Algorithms and Applications, 2010 We investigate which chordal graphs have a representation as intersection graphs of pseudosegments. For positive we have a construction which shows that all chordal graphs that can be represented as intersection graph of subpaths on a tree are pseudosegment intersection graphs. We then study the limits of representability.
Dangelmayr, Cornelia +2 more
openaire +3 more sources
Complexity of Hamiltonian Cycle Reconfiguration
Algorithms, 2018 The Hamiltonian cycle reconfiguration problem asks, given two Hamiltonian cycles C 0 and C t of a graph G, whether there is a sequence of Hamiltonian cycles C 0 , C 1 , … , C t such that C i can be obtained ...
Asahi Takaoka
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
On Strongly Chordal Graphs That Are Not Leaf Powers [PDF]
International Workshop on Graph-Theoretic Concepts 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 ...
Manuel Lafond
semanticscholar +1 more source
Generating subgraphs in chordal graphs
Discrete Applied Mathematics, 2023 13 pages, 1 figure.
Vadim E. Levit, David Tankus
openaire +2 more sources
Representations of Edge Intersection Graphs of Paths in a Tree [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Let $\mathcal{P}$ be a collection of nontrivial simple paths in a tree $T$. The edge intersection graph of $\mathcal{P}$, denoted by EPT($\mathcal{P}$), has vertex set that corresponds to the members of $\mathcal{P}$, and two vertices are joined by an ...
Martin Charles Golumbic +2 more
doaj +1 more source
Perfect Elimination Orderings for Symmetric Matrices [PDF]
, 2017 We introduce a new class of structured symmetric matrices by extending the notion of perfect elimination ordering from graphs to weighted graphs or matrices.
Laurent, Monique, Tanigawa, Shin-ichi
core +5 more sources
On chordal graph and line graph squares [PDF]
Discrete Applied Mathematics, 2018 In this work we investigate the chordality of squares and line graph squares of graphs. We prove a sufficient condition for the chordality of squares of graphs not containing induced cycles of length at least five. Moreover, we characterize the chordality of graph squares by forbidden subgraphs.
Robert Scheidweiler +1 more
openaire +2 more sources