Results 51 to 60 of about 428,321 (154)
Exploiting structure to cope with NP-hard graph problems: Polynomial and exponential time exact algorithms [PDF]
, 2010 An ideal algorithm for solving a particular problem always finds an optimal solution, finds such a solution for every possible instance, and finds it in polynomial time.
VAN-'T-HOF, PIM
core
On a Class of Graphs with Large Total Domination Number [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Let $\gamma(G)$ and $\gamma_t(G)$ denote the domination number and the total domination number, respectively, of a graph $G$ with no isolated vertices. It is well-known that $\gamma_t(G) \leq 2\gamma(G)$.
Selim Bahadır, Didem Gözüpek
doaj +1 more source
Polar graphs are a common generalization of bipartite, cobipartite, and split graphs. They are defined by the existence of a certain partition of vertices, which is NP-complete to decide for general graphs.
Ekim, Tinaz +3 more
core +1 more source
On the correspondence between tree representations of chordal and dually chordal graphs [PDF]
, 2019 Chordal graphs and their clique graphs (called dually chordal graphs) possess characteristic tree representations, namely, the clique tree and the compatible tree, respectively.
De Caria, Pablo Jesús +1 more
core
Generating Chordal Graphs Included in Given Graphs [PDF]
, 2006 A chordal graph is a graph which contains no chordless cycle of at least four edges as an induced subgraph. The class of chordal graphs contains many famous graph classes such as trees, interval graphs, and split graphs, and is also a subclass of perfect
KIYOMI, Masashi, UNO, Takeaki
core +1 more source
Recognizing Chordal-Bipartite Probe Graphs [PDF]
, 2007 A graph G is chordal-bipartite probe if its vertices can be partitioned into two sets P (probes) and N (non-probes) where N is a stable set and such that G can be extended to a chordal-bipartite graph by adding edges between non-probes. A bipartite graph
Lipshteyn, Marina +6 more
core +3 more sources
Requiring that Minimal Separators Induce Complete Multipartite Subgraphs
Discussiones Mathematicae Graph Theory, 2018 Complete multipartite graphs range from complete graphs (with every partite set a singleton) to edgeless graphs (with a unique partite set). Requiring minimal separators to all induce one or the other of these extremes characterizes, respectively, the ...
McKee Terry A.
doaj +1 more source
On powers and centers of chordal graphs
, 1983 A graph is chordal if every cycle of length strictly greater than three has a chord. A necessary and sufficient condition is given for all powers of a chordal graph to be chordal. In addition, it is shown that for connected chordal graphs the center (the
Shier, Douglas, Laskar, Renu
core +1 more source
Maximal outerplanar graphs as chordal graphs, path-neighborhood graphs, and triangle graphs [PDF]
Maximal outerplanar graphs are characterized using three different classes of graphs. A path-neighborhood graph is a connected graph in which every neighborhood induces a path. The triangle graph $T(G)$ has the triangles of the graph $G$ as its vertices,
Novick, B., Laskar, R.C., Mulder, H.M.
core
, 2013 We investigate here the intersection graphs of horizontal and vertical line segments in the plane, the so called B 0-VPG graphs. A forbidden induced subgraph characterization of B 0-VPG split graphs is given, and we present a linear time algorithm to ...
Golumbic, Martin Charles, Ries, Bernard
core +1 more source