Pages that link to "Item:Q1401245"
From MaRDI portal
The following pages link to Mixed hypergraphs with bounded degree: Edge-coloring of mixed multigraphs. (Q1401245):
Displaying 7 items.
- Maximum number of colors in hypertrees of bounded degree (Q302137) (← links)
- Non-monochromatic non-rainbow colourings of \(\sigma\)-hypergraphs (Q394316) (← links)
- Color-bounded hypergraphs. I: General results (Q1044919) (← links)
- Linear-time algorithm for the edge-colorability of a graph with prescribed vertex types (Q1411559) (← links)
- Approximability of the upper chromatic number of hypergraphs (Q2346334) (← links)
- Coloring mixed hypertrees (Q2489959) (← links)
- Rainbow faces in edge‐colored plane graphs (Q3652543) (← links)
