Results 121 to 130 of about 10,088 (246)

Forbidden subgraphs that imply 2-factors

Discrete Mathematics, 2008
AbstractThe connected forbidden subgraphs and pairs of connected forbidden subgraphs that imply a 2-connected graph is hamiltonian have been characterized by Bedrossian [Forbidden subgraph and minimum degree conditions for hamiltonicity, Ph.D. Thesis, Memphis State University, 1991], and extensions of these excluding graphs for general graphs of order ...
Ralph J. Faudree, Zdeněk Ryjáček, Jill R. Faudree   +2 more
openaire   +2 more sources

The spectral Turán problem about graphs of given size with forbidden subgraphs

AKCE International Journal of Graphs and Combinatorics
Let G be a graph of size m and [Formula: see text] be the spectral radius of its adjacency matrix. A graph is said to be H-free if it does not contain a subgraph isomorphic to H. Let [Formula: see text] be the graph obtained by adding a pendent vertex to
Amir Rehman, S. Pirzada
doaj   +1 more source

Line game-perfect graphs [PDF]

Discrete Mathematics & Theoretical Computer Science
The $[X,Y]$-edge colouring game is played with a set of $k$ colours on a graph $G$ with initially uncoloured edges by two players, Alice (A) and Bob (B). The players move alternately. Player $X\in\{A,B\}$ has the first move. $Y\in\{A,B,-\}$.
Stephan Dominique Andres, Wai Lam Fong
doaj   +1 more source

Relative timing information and orthology in evolutionary scenarios. [PDF]

Algorithms Mol Biol, 2023
Schaller D, Hartmann T, Lafond M, Stadler PF, Wieseke N, Hellmuth M.   +5 more
europepmc   +1 more source

On Universal Graphs With Forbidden Topological Subgraphs

European Journal of Combinatorics, 1985
A graph \(G^*\) is called universal in a class \(\bar G\) of countable graphs if it contains a copy of every G in \(\bar G.\) The graph \(G^*\) is called strongly universal if every G in \(\bar G\) is isomorphic to an induced subgraph of \(G^*\). For each pair n and m of positive integers, let \(\bar G(\)n,m) represent the class of all countable graphs
openaire   +3 more sources

Density theorems for bipartite graphs and related Ramsey-type results

, 2007
In this paper, we present several density-type theorems which show how to find a copy of a sparse bipartite graph in a graph of positive density.
Fox, Jacob, Sudakov, Benny
core   +4 more sources

Rainbow connection and forbidden subgraphs

Discrete Mathematics, 2015
A connected edge-colored graph G is rainbow-connected if any two distinct vertices of G are connected by a path whose edges have pairwise distinct colors; the rainbow connection number rc ( G ) of G is the minimum number of colors such that G is rainbow-connected.
Ingo Schiermeyer, Petr Vrána, Zdeněk Ryjáček, Přemysl Holub   +3 more
openaire   +2 more sources

A Finite Characterization and Recognition of Intersection Graphs of Hypergraphs with Rank at Most 3 and Multiplicity at Most 2 in the Class of Threshold Graphs

Discussiones Mathematicae Graph Theory, 2017
We characterize the class L32$L_3^2 $ of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 by means of a finite list of forbidden induced subgraphs in the class of threshold graphs.
Metelsky Yury, Schemeleva Kseniya, Werner Frank   +2 more
doaj   +1 more source

Minimal forbidden subgraphs of reducible graph properties [PDF]

, 2001
Amelie Berger
openalex   +1 more source

On Forbidden Subgraphs of (K2, H)-Sim-(Super)Magic Graphs [PDF]

, 2021
Yeva Fadhilah Ashari, A.N.M. Salman, Rinovia Simanjuntak   +2 more
openalex   +1 more source