\(F\)-WORM colorings: results for 2-connected graphs

DOI10.1016/j.dam.2017.05.008zbMath1369.05067DBLPjournals/dam/BujtasT17arXiv1512.00478OpenAlexW2963568288WikidataQ59072329 ScholiaQ59072329MaRDI QIDQ2403800

Zsolt Tuza, Csilla Bujtás

Publication date: 12 September 2017

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.00478

zbMATH Keywords

feasible set2-connected graphsWORM coloringlower chromatic numbergap in chromatic spectrum

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (2)

Mixed hypergraphs and beyond ⋮ Improved bounds for some facially constrained colorings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vertex coloring without large polychromatic stars
• WORM colorings of planar graphs
• \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum
• Coloring mixed hypergraphs: theory, algorithms and applications
• Worm colorings
• 3-consecutive C-colorings of graphs
• A survey of hereditary properties of graphs
• Reducibility among Combinatorial Problems
• 25 pretty graph colouring problems

This page was built for publication: \(F\)-WORM colorings: results for 2-connected graphs