The following pages link to (Q3760547):
Displaying 16 items.
- Some properties of chromatic coefficients of linear uniform hypergraphs (Q844223) (← links)
- On the complexity of recognizing directed path families (Q967290) (← links)
- Chromatic coefficients of linear uniform hypergraphs (Q1272479) (← links)
- A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing (Q1327210) (← links)
- Set systems and dissimilarities (Q1582480) (← links)
- Designing optimally multiplexed SNP genotyping assays (Q1775775) (← links)
- Optimisation and hypergraph theory (Q1813951) (← links)
- Recognizing clique graphs of directed edge path graphs (Q1861580) (← links)
- Sunflower hypergraphs are chromatically unique (Q1877684) (← links)
- On saturation of Berge hypergraphs (Q2122672) (← links)
- Recognizing Helly edge-path-tree graphs and their clique graphs (Q2275917) (← links)
- The maximum vertex coverage problem on bipartite graphs (Q2448919) (← links)
- On the chromaticity of quasi linear hypergraphs (Q2637737) (← links)
- Cardinality constrained path covering problems in grid graphs (Q3156826) (← links)
- The maximum size of an independent set in a nonplanar graph (Q4068742) (← links)
- Coloration de graphes : fondements et applications (Q4809665) (← links)
