Results 81 to 90 of about 3,384,024 (197)

The Cops and Robber game on graphs with forbidden (induced) subgraphs

Contributions to Discrete Mathematics, 2010
The two-player, complete information game of Cops and Robber is played on undirected finite graphs. A number of cops and one robber are positioned on vertices and take turns in sliding along edges. The cops win if, after a move, a cop and the robber are on the same vertex.
Joret, Gwenaël, Kaminski, Marcin, Theis, Dirk   +2 more
openaire   +4 more sources

Graph isomorphism for graph classes characterized by two forbidden induced subgraphs [PDF]

Discrete Applied Mathematics, 2012
We study the complexity of the Graph Isomorphism problem on graph classes that are characterized by a finite number of forbidden induced subgraphs, focusing mostly on the case of two forbidden subgraphs. We show hardness results and develop techniques for the structural analysis of such graph classes, which applied to the case of two forbidden ...
Stefan Kratsch, Pascal Schweitzer
openaire   +6 more sources

Forbidden configurations and dominating bicliques in undirected 2-quasi best match graphs [PDF]

Discrete Applied Mathematics
2-quasi best match graphs (2-qBMGs) are directed graphs that capture a notion of close relatedness in phylogenetics. Here, we investigate the undirected underlying graph of a 2-qBMG (un-2qBMG) and show that they contain neither a path $P_l$ nor a cycle ...
A. Korchmaros, Peter F. Stadler
semanticscholar   +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

Edge‐Length Preserving Embeddings of Graphs Between Normed Spaces

Journal of Graph Theory, Volume 112, Issue 4, Page 491-506, August 2026.
ABSTRACT The concept of graph embeddability, initially formalized by Belk and Connelly and later expanded by Sitharam and Willoughby, extends the question of embedding finite metric spaces into a given normed space. A finite simple graph G = ( V , E ) is said to be ( X , Y )‐embeddable if any set of induced edge lengths from an embedding of G into a ...
Sean Dewar, Eleftherios Kastis, Derek Kitson, William Sims   +3 more
wiley   +1 more source

Planar graph coloring with forbidden subgraphs : why trees and paths are dangerous [PDF]

, 2002
We consider the problem of coloring a planar graph with the minimum number of colors such that each color class avoids one or more forbidden graphs as subgraphs. We perform a detailed study of the computational complexity of this problem.
Penttonen, M., Woeginger, G.J., Fomin, F.V., Kratochvil, J., Broersma, H.J., Schmidt, E.M.   +5 more
core   +2 more sources

Pairwise Imitation and Tournament Graphs

International Economic Review, Volume 67, Issue 3, Page 937-955, August 2026.
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

Characterization and recognition of edge intersection graphs of 3-chromatic hypergraphs with multiplicity at most than two in the class of split graphs

Журнал Белорусского государственного университета: Математика, информатика, 2018
Let Lm(k) denote the class of edge intersection graphs of k-chromatic hypergraphs with multiplicity at most m. It is known that the problem of recognizing graphs from L1(k) is polynomially solvable if k = 2 and is NP-complete if k = 3.
Tatiana V. Lubasheva, Yury M. Metelsky
doaj  

DP-4-Colorability on Planar Graphs Excluding 7-Cycles Adjacent to 4- or 5-Cycles

Mathematics
In order to resolve Borodin’s Conjecture, DP-coloring was introduced in 2017 to extend the concept of list coloring. In previous works, it is proved that every planar graph without 7-cycles and butterflies is DP-4-colorable.
Fan Yang, Xiangwen Li, Ziwen Huang
doaj   +1 more source

Characterizing heavy subgraph pairs for pancyclicity [PDF]

, 2015
Earlier results originating from Bedrossian’s PhD Thesis focus on characterizing pairs of forbidden subgraphs that imply hamiltonian properties. Instead of forbidding certain induced subgraphs, here we relax the requirements by imposing Ore-type degree ...
Broersma, Hajo; id_orcid, Li, Binlong, Zhang, Shenggui, Ning, Bo, Broersma, Haitze J.   +4 more
core   +1 more source