Results 11 to 20 of about 3,384,024 (197)
The Largest Subgraph Without A Forbidden Induced Subgraph [PDF]
CombinatoricaWe initiate the systematic study of the following Turán-type question. Suppose Γ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage ...
Jacob Fox, R. Nenadov, H. Pham
semanticscholar +6 more sources
Reconfiguration of vertex colouring and forbidden induced subgraphs [PDF]
European Journal of Combinatorics, 2022 The reconfiguration graph of the $k$-colourings, denoted $\mathcal{R}_k(G)$, is the graph whose vertices are the $k$-colourings of $G$ and two colourings are adjacent in $\mathcal{R}_k(G)$ if they differ in colour on exactly one vertex. In this paper, we
M. Belavadi, K. Cameron, Owen D. Merkel
semanticscholar +4 more sources
Complexity Dichotomy for List-5-Coloring with a Forbidden Induced Subgraph [PDF]
SIAM Journal on Discrete Mathematics, 2021 For a positive integer $r$ and graphs $G$ and $H$, we denote by $G+H$ the disjoint union of $G$ and $H$, and by $rH$ the union of $r$ mutually disjoint copies of $H$. Also, we say $G$ is $H$-free if $H$ is not isomorphic to an induced subgraph of $G$. We
Sepehr Hajebi, Yanjia Li, S. Spirkl
semanticscholar +4 more sources
Forbidden induced subgraph characterization of circle graphs within split graphs [PDF]
Discrete Applied Mathematics, 2020 A graph is circle if its vertices are in correspondence with a family of chords in a circle in such a way that every two distinct vertices are adjacent if and only if the corresponding chords have nonempty intersection.
Flavia Bonomo-Braberman +3 more
semanticscholar +4 more sources
Forbidden Induced Subgraphs [PDF]
Electronic Notes in Discrete Mathematics, 2016 In descending generality I survey: five partial orderings of graphs, the induced-subgraph ordering, and examples like perfect, threshold, and mock threshold graphs. The emphasis is on how the induced subgraph ordering differs from other popular orderings
T. Zaslavsky
semanticscholar +3 more sources
Line Graphs and Forbidden Induced Subgraphs [PDF]
Journal of Combinatorial Theory, Series B, 2001 Beineke and Robertson independently characterized line graphs in terms of nine forbidden induced subgraphs. In 1994, Šoltés gave another characterization, which reduces the number of forbidden induced subgraphs to seven, with only five exceptional cases.
Lai, Hong-Jian, Šoltés, Ľubomír
core +2 more sources
Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs [PDF]
Journal of Graph Theory, 2019 For a bipartite graph G , let h ˜ ( G ) be the largest t such that either G contains K t , t , a complete bipartite subgraph with parts of size t , or the bipartite complement of G contains K t , t as a subgraph. For a class of graphs F , let h ˜ ( F ) =
M. Axenovich, C. Tompkins, Lea Weber
semanticscholar +7 more sources
On the forbidden induced subgraph probe and sandwich problems
Discrete Applied Mathematics, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
F. Couto +3 more
semanticscholar +4 more sources
Hitting forbidden induced subgraphs on bounded treewidth graphs [PDF]
Information and Computation, 2020 For a fixed graph $H$, the $H$-IS-Deletion problem asks, given a graph $G$, for the minimum size of a set $S \subseteq V(G)$ such that $G\setminus S$ does not contain $H$ as an induced subgraph.
Ignasi Sau, Uéverton dos Santos Souza
semanticscholar +5 more sources
Path Eccentricity and Forbidden Induced Subgraphs
CoRRThe path eccentricity of a connected graph $G$ is the minimum integer $k$ such that $G$ has a path such that every vertex is at distance at most $k$ from the path.
Sylwia Cichacz-Przenioslo +4 more
semanticscholar +4 more sources