↓ Skip to main content
What is this page? Embed badge

Algorithms and Discrete Applied Mathematics

Overview of attention for book
Cover of 'Algorithms and Discrete Applied Mathematics'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Probabilistic Arguments in Graph Coloring (Invited Talk)
  3. Altmetric Badge
    Chapter 2 A PTAS for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree Problem
  4. Altmetric Badge
    Chapter 3 Constant Approximation for Broadcasting in k-cycle Graph
  5. Altmetric Badge
    Chapter 4 Three Paths to Point Placement
  6. Altmetric Badge
    Chapter 5 Vertex Guarding in Weak Visibility Polygons
  7. Altmetric Badge
    Chapter 6 On Collections of Polygons Cuttable with a Segment Saw
  8. Altmetric Badge
    Chapter 7 Rectilinear Path Problems in Restricted Memory Setup
  9. Altmetric Badge
    Chapter 8 New Polynomial Case for Efficient Domination in P 6-free Graphs
  10. Altmetric Badge
    Chapter 9 Higher-Order Triangular-Distance Delaunay Graphs: Graph-Theoretical Properties
  11. Altmetric Badge
    Chapter 10 Separator Theorems for Interval Graphs and Proper Interval Graphs
  12. Altmetric Badge
    Chapter 11 Bounds for the b-chromatic Number of Induced Subgraphs and G − e
  13. Altmetric Badge
    Chapter 12 New Characterizations of Proper Interval Bigraphs and Proper Circular Arc Bigraphs
  14. Altmetric Badge
    Chapter 13 On Spectra of Corona Graphs
  15. Altmetric Badge
    Chapter 14 Axiomatic Characterization of the Median and Antimedian Functions on Cocktail-Party Graphs and Complete Graphs
  16. Altmetric Badge
    Chapter 15 Tree Path Labeling of Hypergraphs – A Generalization of the Consecutive Ones Property
  17. Altmetric Badge
    Chapter 16 On a Special Class of Boxicity 2 Graphs
  18. Altmetric Badge
    Chapter 17 Domination in Some Subclasses of Bipartite Graphs
  19. Altmetric Badge
    Chapter 18 Parameterized Analogues of Probabilistic Computation
  20. Altmetric Badge
    Chapter 19 Algebraic Expressions of Rhomboidal Graphs
  21. Altmetric Badge
    Chapter 20 Solving Hamiltonian Cycle by an EPT Algorithm for a Non-sparse Parameter
  22. Altmetric Badge
    Chapter 21 Associativity for Binary Parallel Processes: A Quantitative Study
  23. Altmetric Badge
    Chapter 22 A Tight Bound for Congestion of an Embedding
  24. Altmetric Badge
    Chapter 23 Auction/Belief Propagation Algorithms for Constrained Assignment Problem
  25. Altmetric Badge
    Chapter 24 Bi-directional Search for Skyline Probability
  26. Altmetric Badge
    Chapter 25 Cumulative Vehicle Routing Problem: A Column Generation Approach
  27. Altmetric Badge
    Chapter 26 Energy Efficient Sweep Coverage with Mobile and Static Sensors
  28. Altmetric Badge
    Chapter 27 Generation of Random Digital Curves Using Combinatorial Techniques
Attention for Chapter 11: Bounds for the b-chromatic Number of Induced Subgraphs and G − e
Altmetric Badge

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
2 Mendeley
Summary Dimensions citations
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Bounds for the b-chromatic Number of Induced Subgraphs and G − e
Chapter number 11
Book title
Algorithms and Discrete Applied Mathematics
Published in
Lecture notes in computer science, February 2015
DOI 10.1007/978-3-319-14974-5_11
Book ISBNs
978-3-31-914973-8, 978-3-31-914974-5
Authors

P. Francis, S. Francis Raj

View on publisher site
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Other 2 100%
Researcher 1 50%
Readers by discipline Count As %
Mathematics 1 50%
Physics and Astronomy 1 50%

This page is provided by Altmetric.