Pages that link to "Item:Q5415727"
From MaRDI portal
The following pages link to Coloring hypercomplete and hyperpath graphs (Q5415727):
Displaying 6 items.
- Coloring hypergraphs of low connectivity (Q2073648) (← links)
- Mycielski type constructions for hypergraphs associated with fractional colorings (Q2254688) (← links)
- Colored hypergraph isomorphism is fixed parameter tractable (Q2258076) (← links)
- The \((p, q)\)-extremal problem and the fractional chromatic number of Kneser hypergraphs (Q2629296) (← links)
- Colorful paths in vertex coloring of graphs. (Q2828929) (← links)
- Properly colored paths and cycles in complete graphs (Q2887147) (← links)