\(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum

DOI10.7151/DMGT.1891zbMath1339.05116arXiv1508.01759OpenAlexW2963456061WikidataQ59072402 ScholiaQ59072402MaRDI QIDQ726653

Csilla Bujtás, Zsolt Tuza

Publication date: 13 July 2016

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

feasible setWORM coloringgap in the chromatic spectrumlower chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (6)

Facially-constrained colorings of plane graphs: a survey ⋮ \(F\)-WORM colorings: results for 2-connected graphs ⋮ Coloring subgraphs with restricted amounts of hues ⋮ WORM colorings of planar graphs ⋮ Mixed hypergraphs and beyond ⋮ ℱ-WORM colorings of some 2-trees: partition vectors

Cites Work

• Maximum number of colors: C-coloring and related problems
• 3-consecutive edge coloring of a graph
• The complexity of chromatic strength and chromatic edge strength
• On the NP-completeness of the \(k\)-colorability problem for triangle-free graphs
• Coloring mixed hypergraphs: theory, algorithms and applications
• Coloring face-hypergraphs of graphs on surfaces
• Equality of domination and transversal numbers in hypergraphs
• Worm colorings
• 3-consecutive C-colorings of graphs
• Mario Gionfriddo and mixed hypergraph coloring
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(K_3\)-WORM colorings of graphs: lower chromatic number and gaps in the chromatic spectrum