Amanote Research
Register
Sign In
Geometric Spanners With Small Chromatic Number
doi 10.1007/978-3-540-77918-6_7
Full Text
Open PDF
Abstract
Available in
full text
Date
Unknown
Authors
Prosenjit Bose
Paz Carmi
Mathieu Couture
Anil Maheshwari
Michiel Smid
Norbert Zeh
Publisher
Springer Berlin Heidelberg
Related search
Fast Greedy Algorithms for Constructing Sparse Geometric Spanners
SIAM Journal on Computing
Mathematics
Computer Science
Characterizing All Trees With Locating-Chromatic Number 3
Electronic Journal of Graph Theory and Applications
Combinatorics
Applied Mathematics
Discrete Mathematics
Chromatic Number, Independence Ratio, and Crossing Number
Ars Mathematica Contemporanea
Algebra
Combinatorics
Number Theory
Geometry
Discrete Mathematics
Theoretical Computer Science
Topology
Stability Number and Chromatic Number of Tolerance Graphs
Discrete Applied Mathematics
Combinatorics
Applied Mathematics
Discrete Mathematics
The Hypocoloring Problem: Complexity and Approximability Results When the Chromatic Number Is Small
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
List Edge Chromatic Number of Graphs With Large Girth
Discrete Mathematics
Combinatorics
Theoretical Computer Science
Discrete Mathematics
Comparison of Roman Domination Number With Domination Number, Independent Domination Number and Chromatic Number of a Graph
International Journal for Research in Applied Science and Engineering Technology
Small Hop-Diameter Sparse Spanners for Doubling Metrics
The B-Chromatic Number of Graphs
International Journal of Computer Applications
