Results 111 to 120 of about 69,865 (208)
Path Eccentricity and Forbidden Induced Subgraphs
CoRRAbstract.
Cichacz, Sylwia +4 more
openaire +3 more sources
"Forbidden Fruit" 1921 Film Costume Design by Natacha Rambova
, 1921 Color photograph costume design by Natacha Rambova for the paramount film "Forbidden Fruit" Art ...
Natacha Rambova
core
On the Caccetta-Haggkvist conjecture with forbidden subgraphs
J. Graph Theory, 2011 The Caccetta-Haggkvist conjecture made in 1978 asserts that every orgraph on n vertices without oriented cycles of length <= l must contain a vertex of outdegree at most (n-1)/l. It has a rather elaborate set of (conjectured) extremal configurations. In this paper we consider the case l=3 that received quite a significant attention in the literature.
openaire +4 more sources
Discussiones Mathematicae Graph Theory, 2017 We characterize the class L32$L_3^2 $ of intersection graphs of hypergraphs with rank at most 3 and multiplicity at most 2 by means of a finite list of forbidden induced subgraphs in the class of threshold graphs.
Metelsky Yury +2 more
doaj +1 more source
On the validity of Lovász’s inequality for induced star-perfect graphs
Journal of Inequalities and ApplicationsLet F $\mathcal{F}$ be a family of graphs. For a graph G, define θ F ( G ) $\theta _{F}(G)$ as the minimum number of induced subgraphs of G, each isomorphic to a member of F $\mathcal{F}$ , needed to cover V ( G ) $V(G)$ , and α F ( G ) $\alpha _{F}(G ...
James Alex, Louis Caccetta
doaj +1 more source
DP-4-Colorability on Planar Graphs Excluding 7-Cycles Adjacent to 4- or 5-Cycles
MathematicsIn order to resolve Borodin’s Conjecture, DP-coloring was introduced in 2017 to extend the concept of list coloring. In previous works, it is proved that every planar graph without 7-cycles and butterflies is DP-4-colorable.
Fan Yang, Xiangwen Li, Ziwen Huang
doaj +1 more source
On Universal Graphs With Forbidden Topological Subgraphs
European Journal of Combinatorics, 1985 A graph \(G^*\) is called universal in a class \(\bar G\) of countable graphs if it contains a copy of every G in \(\bar G.\) The graph \(G^*\) is called strongly universal if every G in \(\bar G\) is isomorphic to an induced subgraph of \(G^*\). For each pair n and m of positive integers, let \(\bar G(\)n,m) represent the class of all countable graphs
openaire +3 more sources
Fast Parallel Algorithms for the Subgraph Homeomorphism & the Subgraph Isomorphism Problems for Classes of Planar Graphs [PDF]
, 1988 23 pagesWe consider the problems of subgraph homeomorphism with fixed pattern graph, recognition, and subgraph isomorphism for some classes of planar graphs.
Lingas, Andrzej, Proskurowski, Andrzej
core
Flips in colorful triangulations
Journal of Computational GeometryThe associahedron is the graph $\mathcal{G}_N$ that has as nodes all triangulations of a convex $N$-gon, and an edge between any two triangulations that differ in a flip operation.
Rohan Acharya +2 more
doaj +1 more source
End-to-End Verification for Subgraph Solving [Elektronisk resurs]
Modern subgraph-finding algorithm implementations consist of thousands of lines of highly optimized code, and this complexity raises questions about their trustworthiness.
Oertel, Andy, +6 more
core +1 more source