Pages that link to "Item:Q1260045"
From MaRDI portal
The following pages link to The edge-coloring of complete hypergraphs. I (Q1260045):
Displaying 16 items.
- Edge coloring complete uniform hypergraphs with many components (Q598467) (← links)
- On almost-regular edge colourings of hypergraphs (Q727175) (← links)
- Amalgamations of almost regular edge-colourings of simple graphs (Q1108284) (← links)
- A simple proof that all 1-designs exist (Q1167171) (← links)
- The controlled rounding problem: Complexity and computational experience (Q1261381) (← links)
- The controlled rounding problem: Relaxations and complexity issues (Q1813913) (← links)
- Cost-efficient mixed-level covering designs for testing experiments (Q2301219) (← links)
- Partitioning the power set of \([n]\) into \(C_k\)-free parts (Q2323815) (← links)
- Factorizations of complete multipartite hypergraphs (Q2374157) (← links)
- Bounds on directed star arboricity in some digraph classes (Q2413182) (← links)
- Decompositions of complete uniform hypergraphs into Hamilton Berge cycles (Q2452426) (← links)
- Euler tours in hypergraphs (Q2658380) (← links)
- Disjoint Spread Systems and Fault Location (Q2830441) (← links)
- Detachments of Hypergraphs I: The Berge–Johnson Problem (Q2908122) (← links)
- Detachments of Amalgamated 3‐Uniform Hypergraphs Factorization Consequences (Q4906045) (← links)
- Decompositions of quasirandom hypergraphs into hypergraphs of bounded degree (Q5039053) (← links)
