Complexity of Compatible Decompositions of Eulerian Graphs and Their Transformations
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Distributed power management protocols for multi-hop mobile ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
On empty convex polygons in a planar point set
Journal of Combinatorial Theory Series A
Tree-depth, subgraph coloring and homomorphism bounds
European Journal of Combinatorics
Graph colouring with no large monochromatic components
Combinatorics, Probability and Computing
On randomized broadcasting in Star graphs
Discrete Applied Mathematics
Distributed power management protocols for multi-hop mobile ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distance constrained labelings of trees
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Mathematical induction is a recursive technique
Proceedings of the 42nd ACM technical symposium on Computer science education
European Journal of Combinatorics
Three optimal algorithms for balls of three colors
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
| Hi-index | 0.00 |
From the Publisher:Invitation to Discrete Mathematics is at once an introduction and a thoroughly comprehensive textbook for courses in combinatorics and graph theory. A lively and entertaining style is combined with rigorous mathematics, and the many illustrations. examples and exercises make the book particularly accessible and user-friendly.