Results 31 to 40 of about 428,321 (154)
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
Compact Routing Schemes for Generalised Chordal Graphs
Journal of Graph Algorithms and Applications, 2005 In this paper, we show how to use the notion of layering-tree introduced in [], in order to obtain polynomial time constructible routing schemes. We describe efficient routing schemes for two classes of graphs that include the class of chordal graphs ...
Yon Dourisboure
doaj +1 more source
Minimum Eccentricity Shortest Paths in some Structured Graph Classes
Journal of Graph Algorithms and Applications, 2016 We investigate the Minimum Eccentricity Shortest Path problem in some structured graph classes. It asks for a given graph to find a shortest path with minimum eccentricity.
Feodor Dragan, Arne Leitert
doaj +1 more source
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
A New Characterization of Unichord-Free Graphs
Discussiones Mathematicae Graph Theory, 2015 Unichord-free graphs are defined as having no cycle with a unique chord. They have appeared in several papers recently and are also characterized by minimal separators always inducing edgeless subgraphs (in contrast to characterizing chordal graphs by ...
McKee Terry A.
doaj +1 more source
Line graphs of directed graphs I [PDF]
Transactions on CombinatoricsWe determine the forbidden induced subgraphs for the intersection of the classes of chordal bipartite graphs and line graphs of acyclic directed graphs. This is a first step towards finding the forbidden induced subgraphs for the class of line graphs of ...
Vaidyanathan Sivaraman, Daniel Slilaty
doaj +1 more source
Computing Minimum Rainbow and Strong Rainbow Colorings of Block Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 A path in an edge-colored graph $G$ is rainbow if no two edges of it are colored the same. The graph $G$ is rainbow-connected if there is a rainbow path between every pair of vertices.
Melissa Keranen, Juho Lauri
doaj +1 more source
Sampling Random Chordal Graphs by MCMC (Student Abstract)
, 2020 Chordal graphs are a widely studied graph class, with applications in several areas of computer science, including structural learning of Bayesian networks. Many problems that are hard on general graphs become solvable on chordal graphs.
Sun, Wenbo, Bezáková, Ivona
core +1 more source
Introducing subclasses of basic chordal graphs [PDF]
, 2013 Basic chordal graphs arose when comparing clique trees of chordal graphs and compatible trees of dually chordal graphs. They were defined as those chordal graphs whose clique trees are exactly the compatible trees of its clique graph.
de Caria, Pablo Jesús +1 more
core +1 more source