320 research outputs found

    On the Core of a Graph†

    Full text link
    Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/135576/1/plms0305.pd

    On a special case of Hadwiger's conjecture

    Get PDF
    Hadwiger's Conjecture seems difficult to attack, even in the very special case of graphs G of independence number α (G) = 2. We present some results in this special case

    On the 2-extendability of planar graphs

    Get PDF
    AbstractSome sufficient conditions for the 2-extendability of k-connected k-regular (k⩾3) planar graphs are given. In particular, it is proved that for k⩾3, a k-connected k-regular planar graph with each cyclic cutset of sufficiently large size is 2-extendable

    Maximum and minimum toughness of graphs of small genus

    Get PDF
    AbstractA new lower bound on the toughness t(G) of a graph G in terms of its connectivity ϰ(G) and genus γ(G) is obtained. For γ > 0, the bound is sharp via an infinite class of extremal graphs all of girth 4. For planar graphs, the bound is t(G) > ϰ(G)/2 − 1. For ϰ = 1 this bound is not sharp, but for each ϰ = 3, 4, 5 and any ϵ > 0, infinite families of graphs {G(ϰ, ϵ)} are provided with ϰ(G(ϰ, ϵ)) = ϰ, but t(G(ϰ, ϵ)) < ϰ/2 − 1 + ϵ.Analogous investigations on the torus are carried out, and finally the question of upper bounds is discussed. Several unanswered questions are posed

    On well-covered triangulations: Part I

    Get PDF
    AbstractA graph G is said to be well-covered if every maximal independent set of vertices has the same cardinality. A planar (simple) graph in which each face is a triangle is called a triangulation. It is the aim of this paper to prove that there are no 5-connected planar well-covered triangulations

    On a family of line-critical graphs

    Full text link
    Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/41630/1/605_2005_Article_BF01299958.pd
    • …
    corecore