Results 11 to 20 of about 8,313 (308)
On the First-Order Complexity of Induced Subgraph Isomorphism [PDF]
Logical Methods in Computer Science, 2019 Given a graph $F$, let $I(F)$ be the class of graphs containing $F$ as an induced subgraph. Let $W[F]$ denote the minimum $k$ such that $I(F)$ is definable in $k$-variable first-order logic.
Oleg Verbitsky, Maksim Zhukovskii
doaj +2 more sources
Planar Induced Subgraphs of Sparse Graphs [PDF]
Journal of Graph Algorithms and Applications, 2014 We show that every graph has an induced pseudoforest of at least n−m/4.5 vertices, an induced partial 2-tree of at least n−m/5 vertices, and an induced planar subgraph of at least n−m/5.2174 vertices. These results are constructive, implying linear-time algorithms to find the respective induced subgraphs.
Glencora Borradaile +2 more
openaire +4 more sources
Maximum Induced Subgraph of an Augmented Cube [PDF]
, 2014 Let maxζG(m) denote the maximum number of edges in a subgraph of graph G induced by m nodes. The n-dimensional augmented cube, denoted as AQn, a variation of the hypercube, possesses some properties superior to those of the hypercube.
Chang-Hsiung Tsai +2 more
core +3 more sources
Spectral bounds for the k-regular induced subgraph problem [PDF]
, 2017 Many optimization problems on graphs are reduced to the determination of a subset of vertices of maximum cardinality which induces a $k$-regular subgraph.
Pinheiro, Sofia J. +3 more
core +3 more sources
Efficient Frequent Connected Induced Subgraph Mining in Graphs of Bounded Tree-Width
Lecture Notes in Computer Science, 2013 . We study frequent connected induced subgraph mining, i.e., the problem of listing all connected graphs that are induced subgraph isomorphic to at least a certain number of transaction graphs.
Tamás Horvath +2 more
exaly +2 more sources
Construction of a family of graphs with a small induced proper subgraph with minimum degree 3
Discrete Mathematics, 2007 We investigate the following question proposed by Erdős: Is there a constant c such that, for each n, if G is a graph with n vertices, 2n-1 edges, and δ(G)⩾3, then G contains an induced proper subgraph H with at least cn vertices and δ(H)⩾3?Previously we
Choi, Sul-young, Guan, Puhua
exaly +2 more sources
Induced Subgraphs of Induced Subgraphs of Large Chromatic Number
Combinatorica, 2023 AbstractWe prove that, for every graph F with at least one edge, there is a constant $$c_F$$ c F such that there are graphs of arbitrarily large chromatic number and the same clique number as F in which every F-free induced subgraph has chromatic number at ...
Girao, A +6 more
openaire +4 more sources
Non-adaptive Group Testing on Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2018 Grebinski and Kucherov (1998) and Alon et al. (2004-2005) study the problem of learning a hidden graph for some especial cases, such as hamiltonian cycle, cliques, stars, and matchings.
Hamid Kameli
doaj +1 more source
Partitioning algorithms for induced subgraph problems [PDF]
, 2023 This dissertation introduces the MCSPLIT family of algorithms for two closely-related NP-hard problems that involve finding a large induced subgraph contained by each of two input graphs: the induced subgraph isomorphism problem and the maximum common ...
Trimble, James
core +1 more source
On subgraphs without large components [PDF]
Mathematica Bohemica, 2017 We consider, for a positive integer $k$, induced subgraphs in which each component has order at most $k$. Such a subgraph is said to be $k$-divided. We show that finding large induced subgraphs with this property is NP-complete.
Glenn G. Chappell, John Gimbel
doaj +1 more source