Problems on cycles and colorings

DOI10.1016/J.DISC.2013.04.016zbMATH Open1277.05074OpenAlexW2157818988MaRDI QIDQ383772FDOQ383772

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

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

zbMATH Keywords

graph coloringhypergraph coloringcycles in graphsopen problems

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• Title not available (Why is that?)
• 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)