scientific article; zbMATH DE number 3706474
From MaRDI portal
Publication:3898516
Cited in
(10)- Hadwiger's conjecture for proper circular arc graphs
- Efficient algorithms for wavelength assignment on trees of rings
- Routing and path multicoloring
- On routing of wavebands for all-to-all communications in all-optical paths and cycles
- Perfect circular arc coloring
- Revisiting Tucker's algorithm to color circular-arc graphs
- Selfish Routing and Path Coloring in All-Optical Networks
- Fractional path coloring in bounded degree trees with applications
- On the page number of RNA secondary structures with pseudoknots
- -binding functions for squares of convex bipartite graphs and partite testability for bipartite squares
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3898516)
