𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Critical 3-cochromatic graphs

✍ Scribed by Leif K. Jørgensen

Publisher
Springer Japan
Year
1995
Tongue
English
Weight
300 KB
Volume
11
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Critically cochromatic graphs
Critically cochromatic graphs
✍ Izak Broere; Marieta Burger 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 261 KB

and z(Gu) = n -1 for every vertex u of G. Properties of critically n cochromatic graphs are discussed and we also construct graphs that are critically n-chromatic and critically ncochromatic.

The cochromatic index of a graph
The cochromatic index of a graph
✍ Lowell Beineke; Richard Ringeisen; H.Joseph Straight 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 684 KB

We discuss partitions of the edge set of a graph into subsets which are uniform in their internal relationships; i.e., the edges are independent, they are incident with a common vertex (a star), or three edges meet in a triangle. We define the cochromatic index z'(G) of G to be the minimum number of

Cochromatic Number and the Genus of a Gr
Cochromatic Number and the Genus of a Graph
✍ H. Joseph Straight 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 310 KB 👁 1 views

## Abstract The cochromatic number of a graph __G__, denoted by __z__(__G__), is the minimum number of subsets into which the vertex set of __G__ can be partitioned so that each sbuset induces an empty or a complete subgraph of __G__. In this paper we introduce the problem of determining for a surf

Codiameters of 3-connected 3-domination
Codiameters of 3-connected 3-domination critical graphs
✍ Yaojun Chen; Feng Tian; Bing Wei 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB

## Abstract A graph __G__ is 3‐domination critical if its domination number γ is 3 and the addition of any edge decreases γ by 1. Let __G__ be a 3‐connected 3‐domination critical graph of order __n__. In this paper, we show that there is a path of length at least __n__−2 between any two distinct ve

Critical graphs for subpancyclicity of 3
Critical graphs for subpancyclicity of 3-connected claw-free graphs
✍ Ronald J. Gould; Tomasz Łuczak; Florian Pfender 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 173 KB

## Abstract Let ${\cal{F}}\_{k}$ be the family of graphs __G__ such that all sufficiently large __k__ ‐connected claw‐free graphs which contain no induced copies of __G__ are subpancyclic. We show that for every __k__≥3 the family ${\cal{F}}\_{1}k$ is infinite and make the first step toward the c