Results 11 to 20 of about 735 (221)
Toughness, Forbidden Subgraphs and Pancyclicity [PDF]
Graphs and Combinatorics, 2021 AbstractMotivated by several conjectures due to Nikoghosyan, in a recent article due to Li et al., the aim was to characterize all possible graphs H such that every 1-tough H-free graph is hamiltonian. The almost complete answer was given there by the conclusion that every proper induced subgraph H of $$K_1\cup P_4$$
Wei Zheng, Hajo Broersma, Ligong Wang
openalex +3 more sources
Forbidden Induced Subgraphs [PDF]
Electronic Notes in Discrete Mathematics, 2017 In descending generality I survey: five partial orderings of graphs, the induced-subgraph ordering, and examples like perfect, threshold, and mock threshold graphs. The emphasis is on how the induced subgraph ordering differs from other popular orderings and leads to different basic questions.
Thomas Zasĺavsky
+6 more sources
Forbidden subgraphs in terms of forbidden quantifiers. [PDF]
Notre Dame Journal of Formal Logic, 1978 T. A. McKee
openalex +4 more sources
Splits with forbidden subgraphs [PDF]
Discrete Mathematics, 2021 In this note, we fix a graph $H$ and ask into how many vertices can each vertex of a clique of size $n$ can be "split" such that the resulting graph is $H$-free. Formally: A graph is an $(n,k)$-graph if its vertex sets is a pairwise disjoint union of $n$ parts of size at most $k$ each such that there is an edge between any two distinct parts. Let $$ f(
Maria Axenovich, Ryan R. Martin
openalex +5 more sources
Forbidden Subgraphs of Power Graphs [PDF]
The Electronic Journal of Combinatorics, 2021 The undirected power graph (or simply power graph) of a group $G$, denoted by $P(G)$, is a graph whose vertices are the elements of the group $G$, in which two vertices $u$ and $v$ are connected by an edge between if and only if either $u=v^i$ or $v=u^j$ for some $i$, $j$.
Manna, Pallabi +2 more
openaire +5 more sources
Forbidden subgraphs for chorded pancyclicity [PDF]
Discrete Mathematics, 2017 We call a graph $G$ pancyclic if it contains at least one cycle of every possible length $m$, for $3\le m\le |V(G)|$. In this paper, we define a new property called chorded pancyclicity. We explore forbidden subgraphs in claw-free graphs sufficient to imply that the graph contains at least one chorded cycle of every possible length $4, 5, \ldots, |V(G)|
Megan Cream +2 more
openalex +4 more sources
Forbidden subgraph decomposition
Discrete Mathematics, 2002 no ...
Rusu, Irena, Spinrad, Jeremy P.
openaire +2 more sources
3-Rainbow Index and Forbidden Subgraphs [PDF]
Graphs and Combinatorics, 2017 11 ...
Li, Wenjing +2 more
openaire +3 more sources
Forbidden subgraphs that imply hamiltonian‐connectedness* [PDF]
Journal of Graph Theory, 2002 AbstractIt is proven that if G is a 3‐connected claw‐free graph which is also H1‐free (where H1 consists of two disjoint triangles connected by an edge), then G is hamiltonian‐connected. Also, examples will be described that determine a finite family of graphs ${\cal L}$ such that if a 3‐connected graph being claw‐free and L‐free implies G is ...
Broersma, Haitze J. +4 more
openaire +1 more source
Intersection Dimension and Graph Invariants
Discussiones Mathematicae Graph Theory, 2021 We show that the intersection dimension of graphs with respect to several hereditary properties can be bounded as a function of the maximum degree. As an interesting special case, we show that the circular dimension of a graph with maximum degree Δ is at
Aravind N.R., Subramanian C.R.
doaj +1 more source