Problems on cycles and colorings

DOI10.1016/J.DISC.2013.04.016MaRDI QIDQ383772zbMATH OpenOpenAlexFDO

Authors Zsolt Tuza

Publication date 6 December 2013

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2013.04.016

zbMATH Keywords

graph coloringhypergraph coloringcycles in graphsopen problems

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Hypergraphs (05C65)

Recommendations

• scientific article; zbMATH DE number 25263
• scientific article; zbMATH DE number 821271
• 25 pretty graph colouring problems
• Hypergraph colouring
• scientific article; zbMATH DE number 4134067

Cites work

• scientific article; zbMATH DE number 3831957 (Why is no real title available?)
• scientific article; zbMATH DE number 434896 (Why is no real title available?)
• scientific article; zbMATH DE number 3761989 (Why is no real title available?)
• scientific article; zbMATH DE number 25263 (Why is no real title available?)
• scientific article; zbMATH DE number 26333 (Why is no real title available?)
• scientific article; zbMATH DE number 772760 (Why is no real title available?)
• scientific article; zbMATH DE number 3257176 (Why is no real title available?)
• A Theorem on n-Coloring the Points of a Linear Graph
• A survey of hereditary properties of graphs
• Color-bounded hypergraphs, III: model comparison
• Color-bounded hypergraphs, IV: Stable colorings of hypertrees
• Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees
• Color-bounded hypergraphs. VI: Structural and functional jumps in complexity
• Cycle length parities and the chromatic number
• Cycle lengths and chromatic number of graphs
• Depth-First Search and Linear Graph Algorithms
• Generalized colorings and avoidable orientations
• Graph coloring in linear time
• Graphs with \(k\) odd cycle lengths
• Induced matchings in bipartite graphs
• Induced matchings in cubic graphs
• Misère quotients for impartial games
• Nombre chromatique et plus longs chemins d'un graphe
• ON THE COMPLEXITY OF SOME COLORING GAMES
• On cliques in graphs
• On color critical graphs
• On the complexity of some two-person perfect-information games
• Precoloring extension. I: Interval graphs
• The strong chromatic index of a cubic graph is at most 10
• Two graph-colouring games

Cited in

(6)

• scientific article; zbMATH DE number 475622 (Why is no real title available?)
• Coloring digraphs with forbidden cycles
• Maximising the number of induced cycles in a graph
• Rainbow subgraphs in edge‐colored complete graphs: Answering two questions by Erdős and Tuza
• Local conditions for exponentially many subdivisions
• Research problems

This page was built for publication: Problems on cycles and colorings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q383772)