Results 71 to 80 of about 63,637 (247)
On maximum planar induced subgraphs
Discrete Applied Mathematics, 2006 AbstractThe nonplanar vertex deletion or vertex deletion vd(G) of a graph G is the smallest nonnegative integer k, such that the removal of k vertices from G produces a planar graph G′. In this case G′ is said to be a maximum planar induced subgraph of G.
Jorge Stolfi +4 more
openaire +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.
Pingan Zhu +2 more
openaire +5 more sources
Certifying Induced Subgraphs in Large Graphs
Journal of Graph Algorithms and Applications, 2023 We introduce I/O-efficient certifying algorithms for the recognition of bipartite, split, threshold, bipartite chain, and trivially perfect graphs. When the input graph is a member of the respective class, the certifying algorithm returns a certificate that characterizes this class.Otherwise, it returns a forbidden induced subgraph as a certificate for
Meyer, Ulrich +2 more
openaire +2 more sources
iMetaOmics, EarlyView.This study built a Wenchang chicken haplotype genome and integrated it with 29 others to create a chicken pangenome atlas. Analysis of 354 chickens revealed 185,205 structural variations (SVs), with one‐third derived from homology‐based and transposable elements.
Lihong Gu +9 more
wiley +1 more source
Strong ƒ-Star Factors of Graphs
Discussiones Mathematicae Graph Theory, 2015 Let G be a graph and f : V (G) → {2, 3, . . .}. A spanning subgraph F is called strong f-star of G if each component of F is a star whose center x satisfies degF (x) ≤ ƒ(x) and F is an induced subgraph of G.
Yan Zheng
doaj +1 more source
Weighted Turán Theorems With Applications to Ramsey‐Turán Type of Problems
Journal of Graph Theory, EarlyView.ABSTRACT We study extensions of Turán Theorem in edge‐weighted settings. A particular case of interest is when constraints on the weight of an edge come from the order of the largest clique containing it. These problems are motivated by Ramsey‐Turán type problems.
József Balogh +2 more
wiley +1 more source
Maximum common subgraph: some upper bound and lower bound results
BMC Bioinformatics, 2006 Background Structure matching plays an important part in understanding the functional role of biological structures. Bioinformatics assists in this effort by reformulating this process into a problem of finding a maximum common subgraph between graphical
Jennings Steven F +2 more
doaj +1 more source
New graph classes characterized by weak vertex separators and two-pairs
AKCE International Journal of Graphs and Combinatorics, 2017 A set of vertices whose deletion from a graph would increase the distance between two remaining vertices is called a weak vertex separator of the graph. Two vertices form a two-pair if all chordless paths between them have length .
Terry A. McKee
doaj +1 more source
A Zero Knowledge Authentication Protocol Based on Novel Heuristic Algorithm of Dense Induced Subgraphs Isomorphism [PDF]
Engineering and Technology Journal, 2015 Graphs provide an useful mathematical tool for modeling various real world phenomena. Dense graphs arise in many places of interest, for instance the internet and social networks to name just two. The density of a graph should be a real number reflecting
N. M. G. Al-Saidi +2 more
doaj +1 more source
The Price of Connectivity for Vertex Cover
, 2013 The vertex cover number of a graph is the minimum number of vertices that are needed to cover all edges. When those vertices are further required to induce a connected subgraph, the corresponding number is called the connected vertex cover number, and is
Camby, Eglantine +3 more
core +3 more sources