Results 31 to 40 of about 655,680 (212)
Several results on chordal bipartite graphs [PDF]
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
Computing a Clique Tree with the Algorithm Maximal Label Search
The algorithm MLS (Maximal Label Search) is a graph search algorithm that generalizes the algorithms Maximum Cardinality Search (MCS), Lexicographic Breadth-First Search (LexBFS), Lexicographic Depth-First Search (LexDFS) and Maximal Neighborhood Search (
Anne Berry, Geneviève Simonet
doaj +1 more source
Finding a Maximum-Weight Convex Set in a Chordal Graph
We consider a natural combinatorial optimization problem on chordal graphs, the class of graphs with no induced cycle of length four or more. A subset of vertices of a chordal graph is (monophonically) convex if it contains the vertices of all chordless
Jean Cardinal +2 more
doaj +1 more source
On chordal graph and line graph squares [PDF]
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
Well-partitioned chordal graphs [PDF]
We introduce a new subclass of chordal graphs that generalizes the class of split graphs, which we call well-partitioned chordal graphs. A connected graph G is a well-partitioned chordal graph if there exist a partition P of the vertex set of G into ...
Lima, Paloma T. +8 more
core +1 more source
Approximation and Kernelization for Chordal Vertex Deletion [PDF]
The Chordal Vertex Deletion (ChVD) problem asks to delete a minimum number of vertices from an input graph to obtain a chordal graph. In this paper we develop a polynomial kernel for ChVD under the parameterization by the solution size, as well as poly ...
Jansen, B.M.P.; id_orcid +6 more
core +2 more sources
On the multipacking number of grid graphs [PDF]
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
Maxclique and Unit Disk Characterizations of Strongly Chordal Graphs
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
Complexity of Hamiltonian Cycle Reconfiguration
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
Minimum Eccentricity Shortest Paths in some Structured Graph Classes
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

