Results 51 to 60 of about 566 (185)

On the forbidden induced subgraph probe and sandwich problems

Discrete Applied Mathematics, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fernanda Couto, Luérbio Faria, Sylvain Gravier, Sulamita Klein   +3 more
openaire   +3 more sources

On Fork‐Free t‐Perfect Graphs

Journal of Graph Theory, EarlyView.
ABSTRACT In an effort to understand the complexity of the maximum independent set problem, Chvátal introduced t‐perfect graphs. While a full characterization of this class remains open, important progress has been made for claw‐free graphs [Bruhn and Stein, Math. Program. 2012] and P 5 ${P}_{5}$‐free graphs [Bruhn and Fuchs, SIAM J. Discrete Math. 2017]
Yixin Cao, Shenghua Wang
wiley   +1 more source

Forbidden induced subgraphs for near perfect matchings

Discrete Mathematics, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Katsuhiro Ota, Kenta Ozeki, Gabriel Sueiro   +2 more
openaire   +2 more sources

Coloring Graphs Characterized by a Forbidden Subgraph [PDF]

, 2012
International audienceThe Coloring problem is to test whether a given graph can be colored with at most k colors for some given k, such that no two adjacent vertices receive the same color.
Paulusma, D., Ries, B., Golovach, Petr. A., Golovach, Petr A., Paulusma, Daniel, Petr A. Golovach, Bernard Ries, Golovach, P. A., Daniël Paulusma, Ries, Bernard   +9 more
core   +2 more sources

Pairwise Imitation and Tournament Graphs

International Economic Review, EarlyView.
ABSTRACT This paper investigates strategic dynamics under the behavioral rule of pairwise interact and imitate (PII), which requires minimal information and emphasizes outperforming opponents in pairwise interactions. We characterize PII using weak tournament graphs and, for a broad class of dynamics, establish a one‐shot stability result for ...
Sung‐Ha Hwang, Philip R. Neary, Jonathan Newton, Ryoji Sawa   +3 more
wiley   +1 more source

Forbidden induced subgraphs for line graphs

Discrete Mathematics, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

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

Long Induced Paths in K s , s‐Free Graphs

Journal of Graph Theory, Volume 112, Issue 4, Page 438-441, August 2026.
ABSTRACT More than 40 years ago, Galvin, Rival, and Sands showed that every K s , s‐free graph containing an n‐vertex path must contain an induced path of length f ( n ), where f ( n ) → ∞ as n → ∞. Recently, it was shown by Duron, Esperet, and Raymond that one can take f ( n ) = ( log log n ) 1 / 5 − o ( 1 ).
Zach Hunter, Aleksa Milojević, Benny Sudakov, István Tomon   +3 more
wiley   +1 more source

Forbidden induced subgraphs for star-free graphs

Discrete Mathematics, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jun Fujisawa, Katsuhiro Ota, Kenta Ozeki, Gabriel Sueiro   +3 more
openaire   +1 more source

On Oriented Colourings of Graphs on Surfaces

Journal of Graph Theory, Volume 112, Issue 4, Page 357-369, August 2026.
ABSTRACT For an oriented graph G, the least number of colours required to oriented colour G is called the oriented chromatic number of G and denoted χ o ( G ). For a non‐negative integer g let χ o ( g ) be the least integer such that χ o ( G ) ≤ χ o ( g ) for every oriented graph G with Euler genus at most g.
Alexander Clow
wiley   +1 more source