Results 41 to 50 of about 566 (185)
An induced subgraph characterization of domination perfect graphs [PDF]
, 1995 Let γ(G) ι(G) be the domination number and independent domination number of a graph (G), respectively. A graph (G) is called domination perfect if γ(H) = ι(H), for every induced subgraph H of (G).
Vadim E. Zverovich +5 more
core +1 more source
Characterizing the forbidden pairs for graphs to be super-edge-connected
AKCE International Journal of Graphs and CombinatoricsLet [Formula: see text] be a set of given connected graphs. A graph G is said to be [Formula: see text]-free if G contains no H as an induced subgraph for any [Formula: see text].
Hazhe Ye, Yingzhi Tian
doaj +1 more source
Path Eccentricity and Forbidden Induced Subgraphs
CoRRAbstract.
Cichacz, Sylwia +4 more
openaire +3 more sources
Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs [PDF]
SIAM Journal on Computing, 2007 Alon et. al. [N. Alon, E. Fischer, M. Krivelevich, and M. Szegedy, Combinatorica, 20 (2000), pp. 451-476] showed that every property that is characterized by a finite collection of forbidden induced subgraphs is $\epsilon$-testable. However, the complexity of the test is double-tower with respect to $1/\epsilon$, as the only tool known to construct ...
Noga Alon, Eldar Fischer, Ilan Newman
openaire +1 more source
Forbidden induced subgraph of the Comparability Graph and Three Colored Posets
, 2018 The cover-incomparability graph of a poset P is the edge-union of the covering and the incomparability graph of P. As a continuation of the study of 3-colored diagrams we characterize some forbidden ⊲ - preserving subposets of the posets whose cover ...
Sibi C Babu, Baiju Sukumaran, Athul T B
core +1 more source
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
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
Fractional List Packing for Layered Graphs
Journal of Graph Theory, EarlyView.ABSTRACT The fractional list packing number χ ℓ • ( G ) ${\chi }_{\ell }^{\bullet }(G)$ of a graph G $G$ is a graph invariant that has recently arisen from the study of disjoint list‐colourings. It measures how large the lists of a list‐assignment L : V ( G ) → 2 N $L:V(G)\to {2}^{{\mathbb{N}}}$ need to be to ensure the existence of a “perfectly ...
Stijn Cambie, Wouter Cames van Batenburg
wiley +1 more source
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
Lower Bounds for Maximum Weight Bisections of Weighted Triangle‐Free Subcubic Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A bisection of a graph is a cut in which the number of vertices in the two parts of the cut differ by at most 1. In this paper, we consider maximum weight bisections of edge‐weighted triangle‐free subcubic graphs and show that every weighted triangle‐free subcubic graph G = ( V , E , w ) $G=(V,E,w)$ has a bisection with weight at least θ ⋅ w (
Stefanie Gerke +3 more
wiley +1 more source