Results 31 to 40 of about 8,313 (308)
Quasipolynomiality of the Smallest Missing Induced Subgraph
, 2023 We study the problem of finding the smallest graph that does not occur as an induced subgraph of a given graph. This missing induced subgraph has at most logarithmic size and can be found by a brute-force search, in an $n$-vertex graph, in time $n^{O ...
Virginia Vassilevska Williams +6 more
core +1 more source
Discrete Mathematics, 1992 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hal A. Kierstead, William T. Trotter
openaire +2 more sources
Discrete Mathematics, 1988 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yoshimi Egawa +2 more
openaire +2 more sources
Polyhedral properties of the induced cluster subgraphs [PDF]
Discrete Applied Mathematics, 2021 A cluster graph is a graph whose every connected component is a complete graph. Given a simple undirected graph $G$, a subset of vertices inducing a cluster graph is called an independent union of cliques (IUC), and the IUC polytope associated with $G$ is defined as the convex hull of the incidence vectors of all IUCs in the graph. The {\sc Maximum IUC}
Seyedmohammadhossein Hosseinian +1 more
openaire +3 more sources
Reconfiguration of Regular Induced Subgraphs
, 2022 We study the problem of checking the existence of a step-by-step transformation of $d$-regular induced subgraphs in a graph, where $d \ge 0$ and each step in the transformation must follow a fixed reconfiguration rule. Our problem for $d=0$ is equivalent to \textsc{Independent Set Reconfiguration}, which is one of the most well-studied reconfiguration ...
Hiroshi Eto +4 more
openaire +2 more sources
Induced Subgraphs of the Power of a Cycle [PDF]
SIAM Journal on Discrete Mathematics, 1989 In this article, it is shown that if G is an induced subgraph of the dth power of a cycle of length n, and G has minimum degree $d + k$, then G has at least $[ (d + k)/2d ]n$ vertices. This answers a problem of Kezdy.
Jean-Claude Bermond, Claudine Peyrat
openaire +2 more sources
Graphs containing finite induced paths of unbounded length [PDF]
Discrete Mathematics & Theoretical Computer Science, 2022 The age $\mathcal{A}(G)$ of a graph $G$ (undirected and without loops) is the collection of finite induced subgraphs of $G$, considered up to isomorphy and ordered by embeddability. It is well-quasi-ordered (wqo) for this order if it contains no infinite
Maurice Pouzet, Imed Zaguia
doaj +1 more source
On induced subgraphs of the cube
Journal of Combinatorial Theory, Series A, 1988 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fan R. K. Chung +3 more
openaire +2 more sources
Induced Subgraphs and Path Decompositions
The Electronic Journal of Combinatorics, 2023 A graph $H$ is an induced subgraph of a graph $G$ if a graph isomorphic to $H$ can be obtained from $G$ by deleting vertices. Recently, there has been significant interest in understanding the unavoidable induced subgraphs for graphs of large treewidth.
openaire +2 more sources
The line completion number of hypercubes
AKCE International Journal of Graphs and Combinatorics, 2019 In 1992, Bagga, Beineke, and Varma introduced the concept of the super line graph of index of a graph denoted by The vertices of are the -subsets of and two vertices and are adjacent if there exist and such that and are adjacent edges in They also ...
S.A. Tapadia, B.N. Waphare
doaj +1 more source