Pages that link to "Item:Q1073804"
From MaRDI portal
The following pages link to The chromatic index of simple hypergraphs (Q1073804):
Displaying 14 items.
- A method of finding automorphism groups of endomorphism monoids of relational systems. (Q879337) (← 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)
- 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)
- The Erdős–Faber–Lovász conjecture for the class of δEFL graphs (Q5013484) (← 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)
