Results 41 to 50 of about 2,481 (263)
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
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
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
Several results on chordal bipartite graphs [PDF]
, 1997 summary:The question of generalizing results involving chordal graphs to similar concepts for chordal bipartite graphs is addressed. First, it is found that the removal of a bisimplicial edge from a chordal bipartite graph produces a chordal bipartite ...
Bono, Aaron, Bakonyi, Mihály
core +1 more source
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
Discrete Applied Mathematics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tínaz Ekim +3 more
openaire +1 more source
On the multipacking number of grid graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 In 2001, Erwin introduced broadcast domination in graphs. It is a variant of classical domination where selected vertices may have different domination powers. The minimum cost of a dominating broadcast in a graph $G$ is denoted $\gamma_b(G)$.
Laurent Beaudou, Richard C. Brewster
doaj +1 more source
Graph Decompositions and Factorizing Permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2002 A factorizing permutation of a given graph is simply a permutation of the vertices in which all decomposition sets appear to be factors. Such a concept seems to play a central role in recent papers dealing with graph decomposition. It is applied here for
Christian Capelle +2 more
doaj +3 more sources
Generating subgraphs in chordal graphs
Discrete Applied Mathematics, 2023 13 pages, 1 figure.
Vadim E. Levit, David Tankus
openaire +2 more sources
Clique Graphs of Chordal and Path Graphs [PDF]
SIAM Journal on Discrete Mathematics, 1994 Clique graphs of chordal and (undirected) path graphs are characterized. The clique graph of a graph \(G\) is the intersection graph of maximal cliques of \(G\). A chordal graph is the intersection graph of subtrees of a tree. A path graph is the intersection graph of paths of a tree. (Given a family \(F\) of subsets, the intersection graph of \(F\) is
Jayme Luiz Szwarcfiter +1 more
openaire +2 more sources