𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Perfect graphs and norms

✍ Scribed by Leszek S. Zaremba

Publisher
Springer-Verlag
Year
1991
Tongue
English
Weight
169 KB
Volume
51
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Norms and perfect graphs
Norms and perfect graphs
✍ S. Perz; S. Rolewicz πŸ“‚ Article πŸ“… 1990 πŸ› Springer 🌐 English βš– 426 KB
Perfect Graphs, Partitionable Graphs and
Perfect Graphs, Partitionable Graphs and Cutsets
✍ Michele Conforti; GΓ©rard CornuΓ©jols; Grigor Gasparyan; Kristina VuΕ‘koviΔ‡ πŸ“‚ Article πŸ“… 2002 πŸ› Springer-Verlag 🌐 English βš– 247 KB
Reconstructibility and perfect graphs
Reconstructibility and perfect graphs
✍ Michael Von Rimscha πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 738 KB

It is shown that the following classes of graphs are recognizable (i.e. looking at the point-deleted subgraphs of a graph G one can decide whether G belongs to that class or not): (1) perfect graphs, (2) triangulated graphs, (3) interval graphs, (4) comparability graphs, (5) split graphs. Furthermor

Wings and perfect graphs
Wings and perfect graphs
✍ Stephen Olariu πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 999 KB

An edge uv of a graph G is called a wing if there exists a chordless path with vertices u, v, x, y and edges uv, vx, xy. The wing-graph W(G) of a graph G is a graph having the same vertex set as G; uv is an edge in W(G) if and only if uv is a wing in and some vertex in C is adjacent to all the rema

A generalization of perfect graphs?i-per
A generalization of perfect graphs?i-perfect graphs
✍ Cai, Leizhen; Corneil, Derek πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 1003 KB

Let i be a positive integer. We generalize the chromatic number x ( G ) of G and the clique number w(G) of G as follows: The i-chromatic number of G , denoted by x Z ( G ) , is the least number k for which G has a vertex partition V,, V,, . . . , Vk: such that the clique number of the subgraph induc