✦ LIBER ✦

A sufficient condition for bipartite graphs to be type one

✍ Scribed by Xu, Baogang

Publisher: John Wiley and Sons
Year: 1998
Tongue: English
Weight: 58 KB
Volume: 29
Category: Article
ISSN: 0364-9024
DOI: 10.1002/(sici)1097-0118(199811)29:3<133::aid-jgt1>3.0.co;2-r

No coin nor oath required. For personal study only.

✦ Synopsis

The total chromatic number χ T (G) of graph G is the least number of colors assigned to V (G) ∪ E(G) such that no adjacent or incident elements receive the same color. In this article, we give a sufficient condition for a bipartite graph G to have χ T (G) = ∆(G) + 1.

📜 SIMILAR VOLUMES

Sufficient conditions for a digraph to b

Sufficient conditions for a digraph to be Hamiltonian

✍ Bang-Jensen, J�rgen; Gutin, Gregory; Li, Hao 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 412 KB 👁 1 views

We describe a new type of sufficient condition for a digraph to be Hamiltonian. Conditions of this type combine local structure of the digraph with conditions on the degrees of nonadjacent vertices. The main difference from earlier conditions is that we do not require a degree condition on all pairs