Hajos constructions of critical graphs

T.R. Jensen, Gordon Royle

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

For every k greater than or equal to 4 there exists a k-critical graph that is not Hajos-k-constructible through a sequence of k-critical graphs. This completely answers a question of G. Hajos, which has been answered previously only for k = 8 with an example given by P. Catlin. Also the corresponding problem for Ore's construction has the analogous answer for all k greater than or equal to 4. (C) 1999 John Wiley & Sons, Inc.
Original languageEnglish
Pages (from-to)37-50
JournalJournal of Graph Theory
Volume1
DOIs
Publication statusPublished - 1999

    Fingerprint

Cite this