Results 91 to 100 of about 69,865 (208)
Characterizing heavy subgraph pairs for pancyclicity [PDF]
, 2015 Earlier results originating from Bedrossian’s PhD Thesis focus on characterizing pairs of forbidden subgraphs that imply hamiltonian properties. Instead of forbidding certain induced subgraphs, here we relax the requirements by imposing Ore-type degree ...
Broersma, Hajo; id_orcid +4 more
core +1 more source
Eigenvalues and forbidden subgraphs I
Linear Algebra and its Applications, 2007 Some calculation errors in the first version are ...
openaire +3 more sources
Forbidden Subgraphs for Hamiltonicity of 1-Tough Graphs
Discussiones Mathematicae Graph Theory, 2016 A graph G is said to be 1-tough if for every vertex cut S of G, the number of components of G − S does not exceed |S|. Being 1-tough is an obvious necessary condition for a graph to be hamiltonian, but it is not sufficient in general.
Li Binlong +2 more
doaj +1 more source
3-Colourability and Forbidden Subgraphs
Electronic Notes in Discrete Mathematics, 2000 Abstract In this paper we investigate the chromatic aspects for graphs with forbidden induced subgraphs with emphasis on the question of 3-colourability. In the main part all possible pairs (A, B) of forbidden induced subgraphs, s.t. every A- and B -free graph is 3-colourable, are determined.
openaire +1 more source
Rainbow vertex-connection and forbidden subgraphs
Discussiones Mathematicae Graph Theory, 2018 11 ...
Li Wenjing, Li Xueliang, Zhang Jingshu
openaire +4 more sources
On the number of pentagons in triangle-free graphs [PDF]
, 2013 Using the formalism of flag algebras, we prove that every triangle-free graph G with n vertices contains at most (n/5)(5) cycles of length five. Moreover, the equality is attained only when n is divisible by five and G is the balanced blow-up of the ...
Hatami, Hamed +4 more
core +1 more source
Parallel Algorithms for the Subgraph Homeomorphism Problem
, 1989 The subgraph homeomorphism problem for a fixed graph $H$ is stated as follows: given a graph $G$, determine whether $G$ has a subgraph homeomorphic to $H$, and obtain it.
Khuller, Samir
core +4 more sources
Local certification of forbidden subgraphs
CoRRDetecting specific structures in a network has been a very active theme of research in distributed computing for at least a decade. In this paper, we start the study of subgraph detection from the perspective of local certification. Remember that a local certification is a distributed mechanism enabling the nodes of a network to check the correctness ...
Bousquet, Nicolas +4 more
openaire +4 more sources
Line Graphs and Forbidden Induced Subgraphs
Journal of Combinatorial Theory, Series B, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hong-Jian Lai, Lubomír Soltés
openaire +1 more source
, 2015 Menu from Forbidden Palace restaurant in Los Angeles, CA. Special lunch, Chinese family dinners, soups, chop suey, chow mein, chicken, wun ton, soup noodles, shrimps, spareribs, eggs, squab and duck, rice, miscellaneous, cocktails, mixed drinks, rums ...
Forbidden Palace
core