\(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture
From MaRDI portal
Publication:1949110
DOI10.1016/j.dam.2012.11.012zbMath1263.05031OpenAlexW2067839918WikidataQ123242105 ScholiaQ123242105MaRDI QIDQ1949110
Wu-Hsiung Lin, Gerard Jennhwa Chang
Publication date: 25 April 2013
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2012.11.012
Related Items (8)
Graphs with girth at least 8 are b-continuous ⋮ The \(b\)-chromatic number and related topics -- a survey ⋮ \(b\)-continuity and partial Grundy coloring of graphs with large girth ⋮ The \(b\)-continuity of graphs with large girth ⋮ On the b-coloring of tight graphs ⋮ Some results on the b-chromatic number in complementary prism graphs ⋮ Two Chromatic Conjectures: One for Vertices and One for Edges ⋮ Graphs of girth at least 7 have high \(b\)-chromatic number
Cites Work
- A note on the Erdős--Farber--Lovász conjecture
- Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
- On the combinatorial problems which I would most like to see solved
- Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
- The b-chromatic number of a graph
- The Erdős-Faber-Lovász conjecture for dense hypergraphs
- b-coloring of m-tight graphs
- On a Conjecture of Erdös, Faber, and Lovász about n-Colorings
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture