Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Seymour, P. D.
1982.
Packing nearly-disjoint sets.
Combinatorica,
Vol. 2,
Issue. 1,
p.
91.
Füredi, Z.
1986.
The chromatic index of simple hypergraphs.
Graphs and Combinatorics,
Vol. 2,
Issue. 1,
p.
89.
Chang, W. I.
and
Lawler, E. L.
1988.
Edge coloring of hypergraphs and a conjecture of ErdÖs, Faber, Lovász.
Combinatorica,
Vol. 8,
Issue. 3,
p.
293.
Kahn, Jeff
1992.
Coloring nearly-disjoint hypergraphs with n + o(n) colors.
Journal of Combinatorial Theory, Series A,
Vol. 59,
Issue. 1,
p.
31.
Kahn, Jeff
1997.
The Mathematics of Paul Erdös I.
Vol. 13,
Issue. ,
p.
345.
Berge, Claude
1997.
Motivations and history of some of my conjectures.
Discrete Mathematics,
Vol. 165-166,
Issue. ,
p.
61.
Dvořák, Tomáš
2000.
Chromatic Index of Hypergraphs and Shannon’s Theorem.
European Journal of Combinatorics,
Vol. 21,
Issue. 5,
p.
585.
Araújo, João
and
Konieczny, Janusz
2007.
A method of finding automorphism groups of endomorphism monoids of relational systems.
Discrete Mathematics,
Vol. 307,
Issue. 13,
p.
1609.
PAUL, VIJI
and
GERMINA, K. A.
2012.
ON EDGE COLORING OF HYPERGRAPHS AND ERDÖS–FABER–LOVÁSZ CONJECTURE.
Discrete Mathematics, Algorithms and Applications,
Vol. 04,
Issue. 01,
p.
1250003.
Kahn, Jeff
2013.
The Mathematics of Paul Erdős I.
p.
343.
Lin, Wu-Hsiung
and
Chang, Gerard J.
2013.
b-coloring of tight bipartite graphs and the Erdős–Faber–Lovász conjecture.
Discrete Applied Mathematics,
Vol. 161,
Issue. 7-8,
p.
1060.
Romero, David
and
Alonso-Pecina, Federico
2014.
The Erdős–Faber–Lovász conjecture is true for n ≤ 12.
Discrete Mathematics, Algorithms and Applications,
Vol. 06,
Issue. 03,
p.
1450039.
Simonovits, Miklós
and
Szemerédi, Endre
2019.
Building Bridges II.
Vol. 28,
Issue. ,
p.
445.
Bretto, Alain
Faisant, Alain
and
Hennecart, François
2020.
On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs.
Discrete Mathematics,
Vol. 343,
Issue. 11,
p.
112059.
Zhang, Guo-Hui
and
Skinner, Brett
2020.
Chromatic index of simple hypergraphs.
Discrete Mathematics,
Vol. 343,
Issue. 12,
p.
112087.
Alesandroni, Guillermo
2021.
The Erdős–Faber–Lovász conjecture for weakly dense hypergraphs.
Discrete Mathematics,
Vol. 344,
Issue. 7,
p.
112401.
Dharmarajan, R.
and
Ramachandran, D.
2021.
The Erdős–Faber–Lovász conjecture for the class of δEFL graphs.
Discrete Mathematics, Algorithms and Applications,
Vol. 13,
Issue. 04,
p.
2150034.
Feng, Yun
and
Lin, Wensong
2022.
Some Results on the Erdős–Faber–Lovász Conjecture.
Symmetry,
Vol. 14,
Issue. 7,
p.
1327.
Janzer, Oliver
and
Nagy, Zoltán Lóránt
2022.
Coloring linear hypergraphs: the Erdős–Faber–Lovász conjecture and the Combinatorial Nullstellensatz.
Designs, Codes and Cryptography,
Vol. 90,
Issue. 9,
p.
1991.
Alesandroni, Guillermo
2023.
Monomial invariants applied to graph coloring.
Journal of Algebraic Combinatorics,
Vol. 58,
Issue. 1,
p.
95.