A note on graph coloring extensions and list-colorings
type: Item
instance of: scholarly article
title: A note on graph coloring extensions and list-colorings
zbMATH Open document ID: 1017.05041
published in: The Electronic Journal of Combinatorics
publication date: 2003-05-07T00:00:00Z
full work available at URL: https://eudml.org/doc/122779
full work available at URL: v10i1n1.html
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1907104
zbMATH Keywords: Brooks' theorem
author: Maria Axenovich
MaRDI profile type: Publication
Recommended article: Brooks' theorem for generalized dart graphs
Recommended article: Precoloring Extensions of Brooks' Theorem
Recommended article: An NC algorithm for Brooks' theorem
Recommended article: Brooks Coloring in Parallel
Recommended article: A unified proof of Brooks' theorem and Catlin's theorem
Recommended article: A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs
Recommended article: \(r\)-strong edge colorings of graphs
Recommended article: Variable degeneracy: Extensions of Brooks' and Gallai's theorems
Recommended article: On a list coloring conjecture of Reed
Recommended article: Brooks' Theorem and Beyond
description: scientific article; zbMATH DE number 1907104