Acyclic coloring of graphs without bichromatic long path
type: Item
instance of: scholarly article
title: Acyclic coloring of graphs without bichromatic long path
zbMATH Open document ID: 1325.05081
author: Shu-Fei Wu
author: Jianfeng Hou
published in: Frontiers of Mathematics in China
publication date: 2015-11-06T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 6505563
zbMATH Keywords: coloring
zbMATH Keywords: acyclic
zbMATH Keywords: path
zbMATH Keywords: entropy compression
MaRDI profile type: Publication
full work available at URL: s11464-015-0497-4
OpenAlex ID: W2109280440
cites work: Acyclic coloring of graphs
cites work: On acyclic colorings of graphs on surfaces
cites work: On acyclic colorings of planar graphs
cites work: Acyclic list 7‐coloring of planar graphs
cites work: Acyclic colouring of 1-planar graphs
cites work: A sufficient condition for planar graphs to be acyclically 5-choosable
cites work: Planar graphs without 4- and 5-cycles are acyclically 4-choosable
cites work: Acyclic 4-choosability of planar graphs
cites work: The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
cites work: Estimation of sparse hessian matrices and graph coloring problems
cites work: Q5707698
cites work: Acyclic edge-coloring using entropy compression
cites work: Star coloring of graphs
cites work: Q3549563
cites work: Acyclic colorings of planar graphs
cites work: Note to the paper of Grünbaum on acyclic colorings
cites work: Acyclic and oriented chromatic numbers of graphs
cites work: Acyclic 5-choosability of planar graphs without small cycles
cites work: A constructive proof of the general lovász local lemma
DOI: 10.1007/S11464-015-0497-4
Recommended article: Coloring graphs without bichromatic cycles or paths
Recommended article: Acyclic edge colouring of planar graphs without short cycles
Recommended article: Acyclic edge coloring of planar graphs without cycles of specific lengths
Recommended article: Coloring graphs without short cycles and long induced paths
Recommended article: Coloring Graphs without Short Cycles and Long Induced Paths
Recommended article: Acyclic edge coloring of planar graphs without adjacent cycles
Recommended article: The complexity of coloring graphs without long induced paths
Recommended article: Acyclic edge coloring of planar graphs without small cycles
Recommended article: Acyclic total colorings of planar graphs without \(l\) cycles
Recommended article: Coloring graphs without short non-bounding cycles
description: scientific article; zbMATH DE number 6505563