New families of \(n\)-clusters verifying the Erdős-Faber-Lovász conjecture

DOI10.1007/s00373-016-1733-8zbMath1353.05089OpenAlexW2511336553WikidataQ123263868 ScholiaQ123263868MaRDI QIDQ503615

David Romero, Gilberto Calvillo

Publication date: 13 January 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-016-1733-8

zbMATH Keywords

edge coloringchromatic numberlinear hypergraphchromatic index\(n\)-clusterstrong vertex coloring

Mathematics Subject Classification ID

Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15)

Related Items (1)

Unnamed Item

Cites Work

• The Erdős-Faber-Lovász conjecture -- the uniform regular case
• A note on the Erdős--Farber--Lovász conjecture
• Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász
• Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
• The Erdős-Faber-Lovász conjecture for dense hypergraphs
• ON EDGE COLORING OF HYPERGRAPHS AND ERDÖS–FABER–LOVÁSZ CONJECTURE
• The Erdős–Faber–Lovász conjecture is true for n ≤ 12
• A note on Erd\"os-Faber-Lov\'asz Conjecture and edge coloring of complete graphs
• The Colour Numbers of Complete Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New families of \(n\)-clusters verifying the Erdős-Faber-Lovász conjecture