✦ LIBER ✦

On generalized perfect graphs: bounded degree and bounded edge perfection

✍ Scribed by Edward R. Scheinerman; Ann Trenk

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 856 KB
Volume: 44
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90234-f

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Generalized degree conditions for graphs

Generalized degree conditions for graphs with bounded independence number

✍ Ralph Faudree; Ronald J. Gould; Linda Lesniak; Terri Lindquester 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 511 KB

We consider a generalized degree condition based on the cardinality of the neighborhood union of arbitrary sets of r vertices. We show that a Dirac-type bound on this degree in conjunction with a bound on the independence number of a graph is sufficient to imply certain hamiltonian properties in gra

Perfect coloring and linearly χ-bound P6

Perfect coloring and linearly χ-bound P6-free graphs

✍ S. A. Choudum; T. Karthick; M. A. Shalu 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 169 KB

## Abstract We derive decomposition theorems for __P__~6~, __K__~1~ + __P__~4~‐free graphs, __P__~5~, __K__~1~ + __P__~4~‐free graphs and __P__~5~, __K__~1~ + __C__~4~‐free graphs, and deduce linear χ‐binding functions for these classes of graphs (here, __P__~__n__~ (__C__~__n__~) denotes the path

Bounds on the rank and kernel of perfect

Bounds on the rank and kernel of perfect codes

✍ Kevin T. Phelps; Mercè Villanueva 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 102 KB

Topology of matching, chessboard, and ge

Topology of matching, chessboard, and general bounded degree graph complexes

✍ MichelleL. Wachs 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 531 KB

On low bound of degree sequences of span

On low bound of degree sequences of spanning trees inK-edge-connected graphs

✍ Zhenhong, Liu; Baoguang, Xu 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 257 KB 👁 3 views

[•] is a lower integer form and α depends on k. We show that every k-edge-connected graph with k ≥ 2, has a d k -tree, and α = 1 for k = 2, α = 2 for k ≥ 3.

Degree-bounded coloring of graphs: Varia

Degree-bounded coloring of graphs: Variations on a theme by brooks

✍ S. L. Hakimi; J. Mitchem; E. F. Schmeichel 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 876 KB

## Abstract A graph __G__ is degree‐bounded‐colorable (briefly, db‐colorable) if it can be properly vertex‐colored with colors 1,2, …, k ≤ Δ(__G__) such that each vertex __v__ is assigned a color __c__(__v__) ≤ __v__. We first prove that if a connected graph __G__ has a block which is neither a com