↓ Skip to main content

Graph-Theoretic Concepts in Computer Science

Overview of attention for book
Cover of 'Graph-Theoretic Concepts in Computer Science'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Blow-Ups, Win/Win’s, and Crown Rules: Some New Directions in FPT
  3. Altmetric Badge
    Chapter 2 Matching, Edge-Colouring, and Dimers
  4. Altmetric Badge
    Chapter 3 Minimum Flow Time Graph Ordering
  5. Altmetric Badge
    Chapter 4 Searching Is Not Jumping
  6. Altmetric Badge
    Chapter 5 Incremental Integration Tools for Chemical Engineering: An Industrial Application of Triple Graph Grammars
  7. Altmetric Badge
    Chapter 6 The Minimum Degree Heuristic and the Minimal Triangulation Process
  8. Altmetric Badge
    Chapter 7 Generalized Parametric Multi-terminal Flows Problem
  9. Altmetric Badge
    Chapter 8 Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation
  10. Altmetric Badge
    Chapter 9 The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes
  11. Altmetric Badge
    Chapter 10 Tree Spanners for Bipartite Graphs and Probe Interval Graphs
  12. Altmetric Badge
    Chapter 11 A Simple Linear Time LexBFS Cograph Recognition Algorithm
  13. Altmetric Badge
    Chapter 12 Backbone Colorings for Networks
  14. Altmetric Badge
    Chapter 13 Greedy Edge-Disjoint Paths in Complete Graphs
  15. Altmetric Badge
    Chapter 14 Graph-Based Approaches to Software Watermarking
  16. Altmetric Badge
    Chapter 15 Completely Connected Clustered Graphs
  17. Altmetric Badge
    Chapter 16 An FPT Algorithm for Set Splitting
  18. Altmetric Badge
    Chapter 17 Drawing Planar Graphs on a Curve
  19. Altmetric Badge
    Chapter 18 Tree-Partitions of k -Trees with Applications in Graph Layout
  20. Altmetric Badge
    Chapter 19 Resource Allocation Problems in Multifiber WDM Tree Networks
  21. Altmetric Badge
    Chapter 20 An Improved Upper Bound on the Crossing Number of the Hypercube
  22. Altmetric Badge
    Chapter 21 NCE Graph Grammars and Clique-Width
  23. Altmetric Badge
    Chapter 22 Chordal Probe Graphs
  24. Altmetric Badge
    Chapter 23 Subgraph Induced Planar Connectivity Augmentation
  25. Altmetric Badge
    Chapter 24 On the Recognition of General Partition Graphs
  26. Altmetric Badge
    Chapter 25 Short Cycles in Planar Graphs
  27. Altmetric Badge
    Chapter 26 Complexity of Hypergraph Coloring and Seidel’s Switching
  28. Altmetric Badge
    Chapter 27 Feedback Vertex Set and Longest Induced Path on AT-Free Graphs
  29. Altmetric Badge
    Chapter 28 The Complexity of Graph Contractions
  30. Altmetric Badge
    Chapter 29 Tree Spanners, Cayley Graphs, and Diametrically Uniform Graphs
  31. Altmetric Badge
    Chapter 30 The Probabilistic Minimum Coloring Problem
  32. Altmetric Badge
    Chapter 31 Recognizing Bipolarizable and P 4 -Simplicial Graphs
  33. Altmetric Badge
    Chapter 32 Coloring Powers of Graphs of Bounded Clique-Width
  34. Altmetric Badge
    Chapter 33 Erratum: Cycles in Generalized Networks
Attention for Chapter 32: Coloring Powers of Graphs of Bounded Clique-Width
Altmetric Badge

Mentioned by

wikipedia
8 Wikipedia pages

Readers on

mendeley
3 Mendeley
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
Coloring Powers of Graphs of Bounded Clique-Width
Chapter number 32
Book title
Graph-Theoretic Concepts in Computer Science
Published by
Springer, Berlin, Heidelberg, June 2003
DOI 10.1007/978-3-540-39890-5_32
Book ISBNs
978-3-54-020452-7, 978-3-54-039890-5
Authors

Ioan Todinca, Todinca, Ioan

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 3 100%

Demographic breakdown

Readers by professional status Count As %
Professor 1 33%
Professor > Associate Professor 1 33%
Lecturer 1 33%
Readers by discipline Count As %
Mathematics 1 33%
Agricultural and Biological Sciences 1 33%
Unknown 1 33%