Results 101 to 110 of about 69,865 (208)
Forbidden substructures: induced subgraphs, Ramsey games, and sparse hypergraphs [PDF]
, 2012 We study problems in extremal combinatorics with respect to forbidden induced subgraphs, forbidden colored subgraphs, and forbidden subgraphs. In Chapter 2, we determine exactly which graphs H have the property that almost every H-free graph has a vertex
Butterfield, Jane
core
On Hereditary Helly classes of graphs
Discrete Mathematics & Theoretical Computer Science, 2008 In graph theory, the Helly property has been applied to families of sets, such as cliques, disks, bicliques, and neighbourhoods, leading to the classes of clique-Helly, disk-Helly, biclique-Helly, neighbourhood-Helly graphs, respectively.
Marina Groshaus, Jayme Luiz Szwarcfiter
doaj
Forbidden subgraphs and Hamiltonian properties of graphs
Discrete Mathematics, 1982 AbstractVarious sufficient conditions are given, in terms of forbidden subgraphs, that imply a graph is either homogeneously traceable, hamiltonian or pancyclic.
Ronald J. Gould, Michael S. Jacobson
openaire +3 more sources
A semi-induced subgraph characterization of upper domination perfect graphs [PDF]
, 1999 Let β(G) and Γ(G) be the independence number and the upper domination number of a graph G, respectively. A graph G is called Γ-perfect if β(H) = Γ(H), for every induced subgraph H of G. The class of Γ-perfect graphs generalizes such well-known classes of
Zverovich, Vadim +3 more
core
Certifying Induced Subgraphs in Large Graphs
Journal of Graph Algorithms and ApplicationsWe introduce I/O-efficient certifying algorithms for the recognition of bipartite, split, threshold, bipartite chain, and trivially perfect graphs. When the input graph is a member of the respective class, the certifying algorithm returns a certificate
Ulrich Meyer +2 more
doaj +1 more source
, 2015 Menu from Forbidden City restaurant in San Francisco, CA. Steaks and chops, drinks desserts, dinner, salads, sandwiches, chow mein, chop suey, specials, soup noodles, fried rice, cocktails, mixed drinks, after dinner, cognac, rums, scotch whiskies ...
Forbidden City
core
Small clique number graphs with three trivial critical ideals
Special Matrices, 2018 The critical ideals of a graph are the determinantal ideals of the generalized Laplacian matrix associated to a graph. Previously, they have been used in the understanding and characterizing of the graphs with critical group with few invariant factors ...
Alfaro Carlos A., Valencia Carlos E.
doaj +1 more source
$2$-polarity and algorithmic aspects of polarity variants on cograph superclasses [PDF]
Discrete Mathematics & Theoretical Computer ScienceA graph $G$ is said to be an $(s, k)$-polar graph if its vertex set admits a partition $(A, B)$ such that $A$ and $B$ induce, respectively, a complete $s$-partite graph and the disjoint union of at most $k$ complete graphs.
Fernando Esteban Contreras-Mendoza +1 more
doaj +1 more source
The spectral Turán problem about graphs of given size with forbidden subgraphs
AKCE International Journal of Graphs and CombinatoricsLet G be a graph of size m and [Formula: see text] be the spectral radius of its adjacency matrix. A graph is said to be H-free if it does not contain a subgraph isomorphic to H. Let [Formula: see text] be the graph obtained by adding a pendent vertex to
Amir Rehman, S. Pirzada
doaj +1 more source
Relative timing information and orthology in evolutionary scenarios. [PDF]
Algorithms Mol Biol, 2023 Schaller D +5 more
europepmc +1 more source