Pages that link to "Item:Q1073804"
From MaRDI portal
The following pages link to The chromatic index of simple hypergraphs (Q1073804):
Displaying 21 items.
- A note on the Erdős--Farber--Lovász conjecture (Q868363) (← links)
- A method of finding automorphism groups of endomorphism monoids of relational systems. (Q879337) (← links)
- Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász (Q1112832) (← links)
- A sharpening of Fisher's inequality (Q1175982) (← links)
- A fractional version of the Erdős-Faber-Lovász conjecture (Q1196685) (← links)
- Motivations and history of some of my conjectures (Q1356729) (← links)
- Chromatic index of hypergraphs and Shannon's theorem (Q1580680) (← links)
- The list chromatic index of simple graphs whose odd cycles intersect in at most one edge (Q1690237) (← links)
- Chromatic index of simple hypergraphs (Q2005680) (← links)
- The Erdős-Faber-Lovász conjecture for weakly dense hypergraphs (Q2032720) (← links)
- On hyperedge coloring of weakly trianguled hypergraphs and well ordered hypergraphs (Q2198387) (← links)
- (Q3303467) (← links)
- On the chromatic index of a linear hypergraph and the Chvátal conjecture (Q3348010) (← links)
- (Q3360892) (← links)
- On two conjectures to generalize Vizing's theorem (Q3983098) (← links)
- The Erdős–Faber–Lovász conjecture for the class of δEFL graphs (Q5013484) (← links)
- On the degree, size, and chromatic index of a uniform hypergraph (Q5961544) (← links)
- (Q6076845) (← links)
- Graph and hypergraph colouring via nibble methods: a survey (Q6086395) (← links)
- A proof of the Erdős-Faber-Lovász conjecture (Q6093285) (← links)
- Solution to a problem of Erdős on the chromatic index of hypergraphs with bounded codegree (Q6659522) (← links)
