Document Type

Article

Publication Date

2015

Publication Title

Electronic Journal of Graph Theory and Applications

DOI

10.5614/ejgta.2015.3.1.6

ISSN

2338-2287

Abstract

Given a collection of d-dimensional rectangular solids called blocks, no two of which sharing interior points, construct a block graph by adding a vertex for each block and an edge if the faces of the two corresponding blocks intersect nontrivially. It is known that if d ≥ 3, such block graphs can have arbitrarily large chromatic number. We prove that the chromatic number can be bounded with only a mild restriction on the sizes of the blocks. We also show that block graphs of block configurations arising from partitions of d-dimensional hypercubes into sub-hypercubes are at least d-connected. Bounds on the diameter and the hamiltonicity of such block graphs are also discussed

Comments

Electronic Journal of Graph Theory and Applications provides immediate open access to its content on the principle that making research freely available to the public supports a greater global exchange of knowledge. Full-text access to all papers is available for free.

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Download

Share

COinS