Pages that link to "Item:Q3559384"
From MaRDI portal
The following pages link to Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs (Q3559384):
Displaying 3 items.
- Consensus models: computational complexity aspects in modern approaches to the list coloring problem (Q638544) (← links)
- A note on polynomial algorithm for cost coloring of bipartite graphs with \(\Delta \leq 4\) (Q2175244) (← links)
- Efficiently list-edge coloring multigraphs asymptotically optimally (Q5146931) (← links)