Graphen und Matrices.
From MaRDI portal
Publication:577965
Cited In (7)
- Quick or cheap? Breaking points in dynamic markets
- Couplings and matchings: combinatorial notes on Strassen's theorem
- Recognizing distributed approval voting forms and correspondences
- Orientable burning number of graphs
- On the complexity of target set selection in simple geometric networks
- Independence, matching and packing coloring of the iterated Mycielskian of graphs
- Flat singularities of chained systems, illustrated with an aircraft model
This page was built for publication: Graphen und Matrices.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q577965)