✦ LIBER ✦

Chromatic number of classes of matrices of zeros and ones

✍ Scribed by Richard A. Brualdi; Rachel Manber

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 505 KB
Volume: 50
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(84)90044-x

No coin nor oath required. For personal study only.

✦ Synopsis

We investigate the chromatic number of a class of matrices of O's and l's with given row and column sum vectors, equivalently the chromatic number of hypergraphs with given degree and dual-degree sequences.

📜 SIMILAR VOLUMES

Maximum determinants of complementary ac

Maximum determinants of complementary acyclic matrices of zeros and ones

✍ Richard A Brualdi; Ernie S Solheid 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 929 KB

We show that for n >~ 5 the maximum determinant of an n x n matrix of zeros and ones whose zeros form an acyclic pattern is [(n-1)/2] [(n-1)/2] and characterize the case of equality. 1 We are indebted to H.J. Ryser for some of the references in this paragraph.

On the eigenvalues of the structure matr

On the eigenvalues of the structure matrix of matrices of zeros and ones

✍ Ruud Ermers; Ben Polman 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 731 KB

Circular Chromatic Numbers and Fractiona

Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs

✍ G.J. Chang; L. Huang; X. Zhu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 171 KB

This paper studies circular chromatic numbers and fractional chromatic numbers of distance graphs G(Z , D) for various distance sets D. In particular, we determine these numbers for those D sets of size two, for some special D sets of size three, for

Subgraphs of large connectivity and chro

Subgraphs of large connectivity and chromatic number in graphs of large chromatic number

✍ N. Alon; D. Kleitman; C. Thomassen; M. Saks; P. Seymour 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB

For each pair k, rn of natural numbers there exists a natural number f(k, rn) such that every f ( k , m)-chromatic graph contains a k-connected subgraph of chromatic number at least rn.

The class of matrices of zeros, ones, an

The class of matrices of zeros, ones, and twos with prescribed row and column sums

✍ Richard A. Brualdi; T.S. Michael 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 929 KB

Edge-face chromatic number and edge chro

Edge-face chromatic number and edge chromatic number of simple plane graphs

✍ Rong Luo; Cun-Quan Zhang 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB

## Abstract Given a simple plane graph __G__, an edge‐face __k__‐coloring of __G__ is a function ϕ : __E__(__G__) ∪ __F__(G) → {1,…,__k__} such that, for any two adjacent or incident elements __a__, __b__ ∈ __E__(__G__) ∪ __F__(__G__), ϕ(__a__) ≠ ϕ(__b__). Let χ~e~(__G__), χ~ef~(__G__), and Δ(__G_