✦ LIBER ✦

The chromatic class and the location of a graph on a closed surface

✍ Scribed by L. S. Mel'nikov

Publisher: SP MAIK Nauka/Interperiodica
Year: 1970
Tongue: English
Weight: 344 KB
Volume: 7
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf01093595

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the chromatic equivalence class of a

On the chromatic equivalence class of a family of graphs

✍ G.L. Chia 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 196 KB

Let P\* denote the graph obtained by joining a new vertex to every vertex of a path on n vertices. Let Ui,j(n) denote the set of all connected graphs obtained from PfwP\* by connecting the four vertices of degree 2 by two paths of lengths s( 1> 0) and t( ~> 1) such that s + t = n -i -j is a constant

On the chromatic polynomial of a graph

✍ David Avis; Caterina De Simone; Paolo Nobili 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 121 KB

On σ-polynomials and a class of chromati

On σ-polynomials and a class of chromatically unique graphs

✍ Qingyan Du 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 655 KB

Du, Q., On o-polynomials and a class of chromatically unique graphs, Discrete Mathematics 115 (1993) 153-165. Let cr(G)=C:,,aicr '-' be the u-polynomial of a graph G. We ask the question: When k and a, are given, what is the largest possible value of ai(O < i < k) for any graph G? In this paper, thi

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.

A bound on the chromatic number of a gra

A bound on the chromatic number of a graph

✍ Paul A. Catlin 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 392 KB

We give an upper bound on the chromatic number of a graph in terms of its maximum degree and the size of the largest complete subgraph. Our result extends a theorem due to i3rook.s.

On the harmonious chromatic number of a

On the harmonious chromatic number of a graph

✍ John Mitchem 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 755 KB

The harmonious chromatic number of a graph G, denoted by h(G), is the least number of colon which can be assigned to the vertices of G such that adjacent vertices are colored differently and any two distinct edges have different color pairs. This is a slight variation of a definition given independe