Chromatic number of classes of matrices of zeros and ones

DOI10.1016/0012-365X(84)90044-XMaRDI QIDQ794654zbMATH OpenOpenAlexFDO

Authors Richard A. Brualdi, Rachel Manber

Publication date 1984

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(84)90044-x

zbMATH Keywords

(0,1)-matriceschromatic numberdegree sequences

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Review text

The authors consider a certain class of matrices of 0's and 1's with given row and column vectors [see so the first author, Linear Algebra Appl. 33, 159-231 (1980; Zbl 0448.05047)]. There is a natural correspondence between this class of matrices and a class of hypergraphs with given degree and dual-degree sequences. The chromatic number of this class of matrices and equivalently the chromatic number of this class of hypergraphs is investigated.

Recommendations

• On the graph chromatic number and the rank of a matrix associated with the graph
• scientific article; zbMATH DE number 4172993
• Combinatorial matrix classes
• scientific article; zbMATH DE number 203020
• scientific article; zbMATH DE number 3895226

Cites work

• scientific article; zbMATH DE number 3182201 (Why is no real title available?)
• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• scientific article; zbMATH DE number 3225808 (Why is no real title available?)
• Matrices of zeros and ones with fixed row and column sum vectors

Cited in

(3)

• On the minimum rank of regular classes of matrices of zeros and ones
• On the upper bound of the diameter of interchange graphs
• Two coloring problems on matrix graphs

This page was built for publication: Chromatic number of classes of matrices of zeros and ones

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q794654)