The Erdős–Faber–Lovász conjecture for the class of δEFL graphs

DOI10.1142/S1793830921500348zbMath1475.05029OpenAlexW3091882373WikidataQ123291231 ScholiaQ123291231MaRDI QIDQ5013484

D. Ramachandran, R. Dharmarajan

Publication date: 30 November 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830921500348

zbMATH Keywords

degreeinduced subgraphcoloringcomplete graphexclusive vertexshared vertex

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Vertex degrees (05C07)

Cites Work

• Unnamed Item
• Unnamed Item
• The Erdős-Faber-Lovász conjecture -- the uniform regular case
• The chromatic index of simple hypergraphs
• On the combinatorial problems which I would most like to see solved
• Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
• A fractional version of the Erdős-Faber-Lovász conjecture
• The Erdős-Faber-Lovász conjecture for dense hypergraphs
• The Erdős–Faber–Lovász conjecture is true for n ≤ 12
• On a Conjecture of Erdös, Faber, and Lovász about n-Colorings