Results 31 to 40 of about 9,740 (155)
Stars in forbidden triples generating a finite set of graphs with minimum degree four
Electronic Journal of Graph Theory and ApplicationsFor a family H of graphs, a graph G is said to be H-free if G contains no member of H as a induced subgraph. Let G4(H) denote the family of connected H-free graphs having minimum degree at least 4.
Takafumi Kotani
doaj +1 more source
Toughness, Forbidden Subgraphs, and Hamilton-Connected Graphs
Discussiones Mathematicae Graph Theory, 2022 A graph G is called Hamilton-connected if for every pair of distinct vertices {u, v} of G there exists a Hamilton path in G that connects u and v. A graph G is said to be t-tough if t·ω(G − X) ≤ |X| for all X ⊆ V (G) with ω(G − X) > 1. The toughness of G,
Zheng Wei, Broersma Hajo, Wang Ligong
doaj +1 more source
Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs
, 2013 Bedrossian characterized all pairs of forbidden subgraphs for a 2-connected graph to be Hamiltonian. Instead of forbidding some induced subgraphs, we relax the conditions for graphs to be Hamiltonian by restricting Ore- and Fan-type degree conditions on ...
Bedrossian +13 more
core +1 more source
Forbidden subgraphs in the norm graph
Discrete Mathematics, 2016 We show that the norm graph constructed in [J. Kollár, L. Rónyai and T. Szabó, Norm-graphs and bipartite Turán numbers, Combinatorica, 16 (1996) 399--406] with $n$ vertices about $\frac{1}{2}n^{2-1/t}$ edges, which contains no copy of $K_{t,(t-1)!+1}$, does not contain a copy of $K_{t+1,(t-1)!-1}$.
Ball, Simeon, PEPE, VALENTINA
openaire +5 more sources
Some Characterizations and NP-Complete Problems for Power Cordial Graphs
Journal of Mathematics, 2023 A power cordial labeling of a graph G=VG,EG is a bijection f:VG⟶1,2,…,VG such that an edge e=uv is assigned the label 1 if fu=fvn or fv=fun, for some n∈N∪0 and the label 0 otherwise, and satisfy the number of edges labeled with 0 and the number of edges ...
C. M. Barasara, Y. B. Thakkar
doaj +1 more source
Proper circular arc graphs as intersection graphs of paths on a grid [PDF]
, 2018 In this paper we present a characterisation, by an infinite family of minimal forbidden induced subgraphs, of proper circular arc graphs which are intersection graphs of paths on a grid, where each path has at most one bend (turn)
Galby, Esther +2 more
core +2 more sources
Vertex Colouring and Forbidden Subgraphs ? A Survey [PDF]
Graphs and Combinatorics, 2004 The monograph ``Graph coloring problems'' by \textit{T. R. Jensen} and \textit{B. Toft} (Wiley, New York) (1995; Zbl 0855.05054) provides a comprehensive list of unsolved problems in chromatic graph theory. The present survey gives an account of the recent development in the area.
Randerath, Bert, Schiermeyer, Ingo
openaire +3 more sources
Deficiency and Forbidden Subgraphs of Connected, Locally-Connected Graphs
Discussiones Mathematicae Graph Theory, 2020 A graph G is locally-connected if the neighbourhood NG(v) induces a connected subgraph for each vertex v in G. For a graph G, the deficiency of G is the number of vertices unsaturated by a maximum matching, denoted by def(G). In fact, the deficiency of a
Li Xihe, Wang Ligong
doaj +1 more source
3-Rainbow Index and Forbidden Subgraphs [PDF]
Graphs and Combinatorics, 2017 11 ...
Wenjing Li +2 more
openaire +3 more sources
Theory and Applications of GraphsFor a family $\mathcal{H}$ of graphs, a graph $G$ is said to be $\mathcal{H}$-free if $G$ contains no member of $\mathcal{H}$ as an induced subgraph. Let $\mathcal{G}_2^{(3)}}(\mathcal{H})$ denote the family of $2$-connected $\mathcal{H}$-free graphs ...
Takafumi Kotani, Yoshimi Egawa
doaj +1 more source