Colourings of (k-r,k)-trees

Trees are generalized to a special kind of higher dimensional complexes known as \((j,k)\)-trees ([L. W. Beineke, R. E. Pippert, On the structure of \((m,n)\)-trees, Proc. 8th S-E Conf. Combinatorics, Graph Theory and Computing, 1977, 75-80]), and which are a natural extension of \(k\)-trees for \(...

Full description

Bibliographic Details
Main Authors: M. Borowiecki, H. P. Patil
Format: Article
Language:English
Published: AGH Univeristy of Science and Technology Press 2017-01-01
Series:Opuscula Mathematica
Subjects:
Online Access:http://www.opuscula.agh.edu.pl/vol37/4/art/opuscula_math_3724.pdf