Pages that link to "Item:Q2348711"
From MaRDI portal
The following pages link to Vertex coloring edge-weighted digraphs (Q2348711):
Displaying 19 items.
- Graphs with vertex-coloring and detectable 2-edge-weighting (Q334127) (← links)
- Digraphs are 2-weight choosable (Q625384) (← links)
- Bounds and fixed-parameter algorithms for weighted improper coloring (Q737104) (← links)
- Vertex-colored encompassing graphs (Q742604) (← links)
- Vertex coloring acyclic digraphs and their corresponding hypergraphs (Q944747) (← links)
- On vertex-coloring 13-edge-weighting (Q1001315) (← links)
- Edge weights and vertex colours (Q1826962) (← links)
- Limitations of current wireless link scheduling algorithms (Q2202005) (← links)
- Coloring the edges of a directed graph (Q2353348) (← links)
- Weak-odd edge-coloring of digraphs (Q2829873) (← links)
- Parameterized (approximate) defective coloring (Q3304104) (← links)
- Edge Coloring and Decompositions of Weighted Graphs (Q3541103) (← links)
- Parameterized (Approximate) Defective Coloring (Q5107096) (← links)
- (Q5164968) (← links)
- (Q5267501) (← links)
- The Power of Oblivious Wireless Power (Q5269826) (← links)
- Effective Wireless Scheduling via Hypergraph Sketches (Q5858652) (← links)
- Defective Coloring on Classes of Perfect Graphs (Q5864723) (← links)
- Vertex-coloring graphs with 4-edge-weightings (Q6081387) (← links)