Results 91 to 100 of about 772 (221)

Complete immersions in graphs with independence number two and small forbidden subgraphs

, 2021
Daniel A. Quiroz
openalex   +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

Universal graphs with a forbidden subgraph: Block path solidity [PDF]

, 2014
Gregory Cherlin, Saharon Shelah
openalex   +1 more source

On Minrank and Forbidden Subgraphs [PDF]

ACM Transactions on Computation Theory, 2019
The minrank over a field F of a graph G on the vertex set { 1,2,… , n } is the minimum possible rank of a matrix M ∈ F n × n such that M
openaire   +4 more sources

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

Complexity Framework for Forbidden Subgraphs I: The Framework

Algorithmica
Abstract For a set of graphs $${\mathcal {H}}$$ H , a graph G is $${\mathcal {H}}$$ H -subgraph-free if G does not contain
Johnson, Matthew, Martin, Barnaby, Oostveen, Jelle J., Pandey, Sukanya, Paulusma, Daniël, Smith, Siani, van Leeuwen, Erik Jan   +6 more
openaire   +2 more sources

Forcing Hamiltonicity in locally finite graphs via forbidden induced subgraphs II: paws [PDF]

, 2020
Karl Heuer, Deniz Sarikaya
openalex   +1 more source

Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs [PDF]

, 2015
Aistis Atminas, Robert Brignall, Vadim Lozin, Juraj Stacho   +3 more
openalex   +1 more source

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

Forbidden subgraphs of coloring graphs

Involve, a Journal of Mathematics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alvarado, Francisco, Butts, Ashley, Farquhar, Lauren, Russell, Heather M.   +3 more
openaire   +3 more sources