Problems on cycles and colorings
type: Item
instance of: scholarly article
title: Problems on cycles and colorings
zbMATH Open document ID: 1277.05074
author: Zsolt Tuza
published in: Discrete Mathematics
publication date: 2013-12-06T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C65
zbMATH DE Number: 6236047
zbMATH Keywords: graph coloring
zbMATH Keywords: cycles in graphs
zbMATH Keywords: hypergraph coloring
zbMATH Keywords: open problems
MaRDI profile type: Publication
full work available at URL: j.disc.2013.04.016
OpenAlex ID: W2157818988
cites work: The strong chromatic index of a cubic graph is at most 10
cites work: Q3944542
cites work: Q3039368
cites work: Precoloring extension. I: Interval graphs
cites work: ON THE COMPLEXITY OF SOME COLORING GAMES
cites work: A survey of hereditary properties of graphs
cites work: Q3649378
cites work: Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees
cites work: Color-bounded hypergraphs, IV: Stable colorings of hypertrees
cites work: Color-bounded hypergraphs. VI: Structural and functional jumps in complexity
cites work: Q3139750
cites work: Induced matchings in bipartite graphs
cites work: Q5545303
cites work: Graphs with \(k\) odd cycle lengths
cites work: Two graph-colouring games
cites work: Induced matchings in cubic graphs
cites work: Q4838466
cites work: Cycle length parities and the chromatic number
cites work: Cycle lengths and chromatic number of graphs
cites work: A Theorem on n-Coloring the Points of a Linear Graph
cites work: On cliques in graphs
cites work: Misère quotients for impartial games
cites work: On color critical graphs
cites work: Nombre chromatique et plus longs chemins d'un graphe
cites work: On the complexity of some two-person perfect-information games
cites work: Generalized colorings and avoidable orientations
cites work: Depth-First Search and Linear Graph Algorithms
cites work: Q3984533
cites work: Q3983109
cites work: Graph coloring in linear time
DOI: 10.1016/J.DISC.2013.04.016
description: scientific article; zbMATH DE number 6236047