Results 31 to 40 of about 552 (213)
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
Discrete Applied Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tínaz Ekim +3 more
openaire +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
Generating subgraphs in chordal graphs
Discrete Applied Mathematics, 2023 13 pages, 1 figure.
Vadim E. Levit, David Tankus
openaire +2 more sources
The Electronic Journal of CombinatoricsA hole in a graph is an induced subgraph which is a cycle of length at least four. A graph is chordal if it contains no holes. Following McKee and Scheinerman (1993), we define the chordality of a graph $G$ to be the minimum number of chordal graphs on $V(G)$ such that the intersection of their edge sets is equal to $E(G)$.
Aristotelis Chaniotis +2 more
openaire +2 more sources
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
Discrete Mathematics, 1994 The authors characterize those multigraphs which are squares of chordal graphs and develop an algorithm for producing the unique square root from its squared chordal graph.
Frank Harary, Terry A. McKee
openaire +1 more source
The leafage of a chordal graph
Discussiones Mathematicae Graph Theory, 1998 19 pages, 3 ...
In-Jen Lin +2 more
openaire +2 more sources