✦ LIBER ✦

On the chromaticity of certain subgraphs of a q-tree

✍ Scribed by Thomas Wanner

Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 389 KB
Volume: 13
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190130510

No coin nor oath required. For personal study only.

✦ Synopsis

We show that a graph G on n I 9 + 1 vertices (where 9 z 2) has the chromatic polynomial P(G; A) = A(A -1) ... (Aq + 2) (A -9 + 1)' (Aq)n-4-1 if and only if G can be obtained from a q-tree Ton n vertices by deleting an edge contained in exactly q -1 triangles of T: Furthermore, we prove that these graphs are triangulated.

1)(Aq)"-'.

📜 SIMILAR VOLUMES

A Note on the m-Bounded Chromatic Number

A Note on the m-Bounded Chromatic Number of a Tree

✍ Bor-Liang Chen; Ko-Wei Lih 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 77 KB

The \(m\)-bounded chromatic number of a graph \(G\) is the smallest number of colors required for a proper coloring of \(G\) in which each color is used at most \(m\) times. We will establish an exact formula for the \(m\)-bounded chromatic number of a tree.

On the number of maximal bipartite subgr

On the number of maximal bipartite subgraphs of a graph

✍ Jesper Makholm Byskov; Bolette Ammitzbøll Madsen; Bjarke Skjernaa 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 72 KB 👁 2 views

We show new lower and upper bounds on the maximum number of maximal induced bipartite subgraphs of graphs with n vertices. We present an infinite family of graphs having 105 n=10 % 1:5926 n ; such subgraphs show an upper bound of O(12 n=4 ) ¼ O(1:8613 n ) and give an algorithm that finds all maximal

A note on the line-distinguishing chroma

A note on the line-distinguishing chromatic number and the chromatic index of a graph

✍ N. Zagaglia Salvi 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 1 views

## Abstract Let λ(__G__) be the line‐distinguishing chromatic number and __x__′(__G__) the chromatic index of a graph __G__. We prove the relation λ(__G__) ≥ __x__′(__G__), conjectured by Harary and Plantholt. © 1993 John Wiley & Sons, Inc.

Sunflower protein isolates chromaticity

Sunflower protein isolates chromaticity Part 2. Effect of chlorogenic acid binding on the chromaticity and available lysine content

✍ Kratch, V. V. ;Lapteva, N. A. ;Alexeyeva, M. V. ;Vaintraub, I. A. 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB 👁 2 views

Sunflower protein isolates chromaticity Part 2. Effectlof chlorogenic acid binding on the chromaticity and available lysine content (short comication) W e are g r a t e f u l t o D r . V . A . Reva and Miss G . V . Burova f o r performing Valentina Vladirnirovna b a t c h .

A lower bound on the chromatic number of

A lower bound on the chromatic number of a graph

✍ B. R. Myers; R. Liu 📂 Article 📅 1971 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 1 views

Forbidden subgraphs and bounds on the si

Forbidden subgraphs and bounds on the size of a maximum matching

✍ Michael D. Plummer; Akira Saito 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 1 views

## Abstract Let __K__~1,__n__~ denote the star on __n__ + 1 vertices; that is, __K__~1,__n__~ is the complete bipartite graph having one vertex in the first vertex class of its bipartition and __n__ in the second. The special graph __K__~1,3~, called the __claw__, has received much attention in the