Results 11 to 20 of about 5,057 (262)
Eigenvalue Conditions for Induced Subgraphs
Discussiones Mathematicae Graph Theory, 2015 Necessary conditions for an undirected graph G to contain a graph H as induced subgraph involving the smallest ordinary or the largest normalized Laplacian eigenvalue of G are presented.
Harant Jochen +2 more
doaj +3 more sources
Efficient enumeration of subgraphs and induced subgraphs with bounded girth [PDF]
, 2018 The girth of a graph is the length of its shortest cycle. Due to its relevance in graph theory, network analysis and practical fields such as distributed computing, girth-related problems have been object of attention in both past and recent literature ...
Conte, Alessio +9 more
core +4 more sources
Detecting induced subgraphs [PDF]
Discrete Applied Mathematics, 2007 An s-graph is a graph with two kinds of edges : subdivisible edges and real edges. A realisation of an s-graphB is any graph obtained by subdividing subdivisible edges of B into paths of arbitrary length (at least one).
Nicolas Trotignon +3 more
core +8 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-
David Eppstein +5 more
core +4 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
Reconfiguring spanning and induced subgraphs [PDF]
Theoretical Computer Science, 2018 Subgraph reconfiguration is a family of problems focusing on the reachability of the solution space in which feasible solutions are subgraphs, represented either as sets of vertices or sets of edges, satisfying a prescribed graph structure property. Although there has been previous work that can be categorized as subgraph reconfiguration, most of the ...
Tesshu Hanaka +7 more
openaire +4 more sources
Connectedness of Unit Distance Subgraphs Induced by Closed Convex Sets
Theory and Applications of Graphs, 2022 The unit distance graph $G^1_{R^d}$ is the infinite graph whose nodes are points in $R^d$, with an edge between two points if the Euclidean distance between these points is $1$. The 2-dimensional version $G^1_{R^2}$ of this graph is typically studied for
Remie Janssen, Leonie van Steijn
doaj +1 more source
Fan's condition on induced subgraphs for circumference and pancyclicity [PDF]
Opuscula Mathematica, 2017 Let \(\mathcal{H}\) be a family of simple graphs and \(k\) be a positive integer. We say that a graph \(G\) of order \(n\geq k\) satisfies Fan's condition with respect to \(\mathcal{H}\) with constant \(k\), if for every induced subgraph \(H\) of \(G ...
Wojciech Wideł
doaj +1 more source
On the 12-Representability of Induced Subgraphs of a Grid Graph
Discussiones Mathematicae Graph Theory, 2022 The notion of a 12-representable graph was introduced by Jones, Kitaev, Pyatkin and Remmel in [Representing graphs via pattern avoiding words, Electron. J. Combin. 22 (2015) #P2.53].
Chen Joanna N., Kitaev Sergey
doaj +1 more source
Equivalent Subgraphs of Order $3$ [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 It is proved that any graph of order $14n/3 + O(1)$ contains a family of n induced subgraphs of order $3$ such that they are vertex-disjoint and equivalent to each other.
Tomoki Nakamigawa
doaj +1 more source