Pages that link to "Item:Q1406033"
From MaRDI portal
The following pages link to A polynomial algorithm for finding \(T\)-span of generalized cacti (Q1406033):
Displaying 4 items.
- Finding cactus roots in polynomial time (Q726100) (← links)
- Greedy \(T\)-colorings of graphs (Q1024485) (← links)
- \(T\)-colorings, divisibility and the circular chromatic number (Q2227106) (← links)
- The computational complexity of the backbone coloring problem for planar graphs with connected backbones (Q2341776) (← links)