Results 31 to 40 of about 59,275 (246)
Domination properties and induced subgraphs
Discrete Mathematics, 1993 Two types of classes of graphs are studied. The class \(\text{Forb}(C_ t,P_ t)\) is the class of all graphs which contain no induced subgraph isomorphic to the circuit \(C_ t\) with \(t\) vertices or to the path \(P_ t\) with \(t\) vertices. The class \(\text{Dom}(d,k)\) is the class of graphs \(G\) in which every connected induced subgraph \(H ...
Zs. Tuza, Gábor Bacsó
openaire +3 more sources
CONSTRUCTION OF BICYCLIC GRAPH AND ITS APPLICATION IN TRANS JOGJA ROUTES
Barekeng, 2023 A bicyclic graph is a type of graph that consists of exactly two cycles. A cycle is a graph that is a closed path where no vertices are repeated except the first and last vertices which are the same.
Aditya Ambarwati, Vira Hari Krisnawati
doaj +1 more source
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. In this paper, we consider the problem of listing connected subgraphs with bounded girth. As a large
Kurita, Kazuhiro +4 more
openaire +4 more sources
The complete list of Ramsey $(2K_2,K_4)$-minimal graphs
Electronic Journal of Graph Theory and Applications, 2015 Let $F, G,$ and $H$ be non-empty graphs. The notation $F \rightarrow (G,H)$ means that if all edges of $F$ are arbitrarily colored by red or blue, then either the subgraph of $F$ induced by all red edges contains a graph $G$ or the subgraph of $F ...
Kristiana Wijaya +3 more
doaj +1 more source
On matroids induced by packing subgraphs
Journal of Combinatorial Theory, Series B, 1988 The class of those connected graphs H is described such that in any graph the vertex set covered by vertex disjoint copies of H and edges form the independent sets of a matroid. The condition is that H is either critical or has a 1-factor, or, finally, it has a degree-one vertex and a vertex c such that for every \(x\neq c\), H-x has a 1-factor.
Martin Loebl, Svatopluk Poljak
openaire +2 more sources
Large induced degenerate subgraphs [PDF]
Graphs and Combinatorics, 1987 A graph G is called d-degenerate (for a positive integer d), if every non-empty subgraph of G contains a vertex of degree smaller than d. The symbol \(\alpha_ d(G)\) denotes the maximum number of vertices of an induced d-degenerate subgraph of G. Further \(e_ d(n,m)\) is the minimum number of edges of a graph G with n vertices and with \(\alpha_ d(G)=m\
Noga Alon, Paul Seymour, Jeff Kahn
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
Edge erasures and chordal graphs
Electronic Journal of Graph Theory and Applications, 2021 We prove several results about chordal graphs and weighted chordal graphs by focusing on exposed edges. These are edges that are properly contained in a single maximal complete subgraph.
Jared Culbertson +2 more
doaj +1 more source
A ramsey-type theorem for multiple disjoint copies of induced subgraphs
Discussiones Mathematicae Graph Theory, 2014 Let k and ℓ be positive integers with ℓ ≤ k − 2. It is proved that there exists a positive integer c depending on k and ℓ such that every graph of order (2k−1−ℓ/k)n+c contains n vertex disjoint induced subgraphs, where these subgraphs are isomorphic to ...
Nakamigawa Tomoki
doaj +1 more source
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