✦ LIBER ✦

Regular totally domatically full graphs

✍ Scribed by Bohdan Zelinka

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 564 KB
Volume: 86
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90350-q

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Domatically critical and domatically ful

Domatically critical and domatically full graphs

✍ Douglas F. Rall 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 396 KB

A subset, D, of the vertex set of a graph G is called a dominating set of G if each vertex of G is either in D or adjacent to some vertex in D. The maximum cardinality of a partition of the vertex set of G into dominating sets is the domatic number of G, denoted d(G). G is said to be domatically cri

The total {k}-domatic number of a graph

✍ S. M. Sheikholeslami; L. Volkmann 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 355 KB

Total colouring regular bipartite graphs

Total colouring regular bipartite graphs is NP-hard

✍ Colin J.H. McDiarmid; Abdón Sánchez-Arroyo 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 437 KB

The total chromatic number of an arbitrary graph is the smallest number of colours needed to colour the edges and vertices of the graph so that no two adjacent or incident elements of the graph receive the same colour. In this paper we prove that the problem of determining the total chromatic number

On antichain intersection numbers, total

On antichain intersection numbers, total clique covers and regular graphs

✍ Morimasa Tsuchiya 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 742 KB

In this paper, we consider total clique covers and intersection numbers on multifamilies. We determine the antichain intersection numbers of graphs in terms of total clique covers. From this result and some properties of intersection graphs on multifamilies, we determine the antichain intersection n

The total chromatic number of regular gr

The total chromatic number of regular graphs whose complement is bipartite

✍ J.K. Dugdale; A.J.W. Hilton 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 705 KB

We show that a regular graph G of order at least 6 whose complement c is bipartite has total chromatic number d(G) + 1 if and only if (i) G is not a complete graph, and (ii) G#K when n is even. As an aid in"';he proof of this, we also show that , for n>4, if the edges of a Hamiltonian path of Kzn a

Total chromatic number of regular graphs

Total chromatic number of regular graphs of odd order and high degree

✍ K.H. Chew 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 695 KB

The total chromatic number XT(G) of a graph G is the least number of colours needed to colour the edges and vertices of G so that no incident or adjacent elements receive the same colour. This paper shows that if G is odd order and regular of degree d > [(&? -1)/6]1 V(G)/, then a necessary and suffi