Results 111 to 120 of about 3,613,364 (137)

Disjoint Paired-Dominating sets in Cubic Graphs. [PDF]

Graphs Comb, 2019
Bacsó G, Bujtás C, Tompkins C, Tuza Z.
europepmc   +1 more source

Finding maximum common contractions between phylogenetic networks. [PDF]

Algorithms Mol Biol
Marchand B, Tahiri N, Fard SG, Tremblay-Savard O, Lafond M.   +4 more
europepmc   +1 more source

A graph modification approach for finding core-periphery structures in protein interaction networks. [PDF]

Algorithms Mol Biol, 2015
Bruckner S, Hüffner F, Komusiewicz C.
europepmc   +1 more source

Strategy Complexity of Reachability in Countable Stochastic 2-Player Games. [PDF]

Dyn Games Appl
Kiefer S, Mayr R, Shirmohammadi M, Totzke P.   +3 more
europepmc   +1 more source

Two Forbidden Induced Subgraphs and Well-Quasi-Ordering

Discrete Mathematics, 2011
It is known that a class of graphs defined by a single forbidden induced subgraph G is well-quasi-ordered by the induced subgraph relation if and only if G is an induced subgraph of P(4).
Nicholas Korpelainen, Vadim V. Lozin
exaly   +2 more sources

The Forbidden Subgraph Characterization of Directed Vertex Graphs

Discrete Mathematics, 1999
A graph is called a directed vertex (DV) graph if it is the intersection graph of a family of directed paths in a directed tree, i.e., a tree in which each edge is oriented, with one or more vertices of indegree zero.
B S Panda
exaly   +2 more sources