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

Computational Geometry and Graphs

Overview of attention for book
Cover of 'Computational Geometry and Graphs'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Operators which Preserve Reversibility
  3. Altmetric Badge
    Chapter 2 Colored Quadrangulations with Steiner Points
  4. Altmetric Badge
    Chapter 3 On Universal Point Sets for Planar Graphs
  5. Altmetric Badge
    Chapter 4 On Non 3-Choosable Bipartite Graphs
  6. Altmetric Badge
    Chapter 5 Edge-disjoint Decompositions of Complete Multipartite Graphs into Gregarious Long Cycles
  7. Altmetric Badge
    Chapter 6 Affine Classes of 3-Dimensional Parallelohedra - Their Parametrization -
  8. Altmetric Badge
    Chapter 7 On Complexity of Flooding Games on Graphs with Interval Representations
  9. Altmetric Badge
    Chapter 8 How to Generalize Janken – Rock-Paper-Scissors-King-Flea
  10. Altmetric Badge
    Chapter 9 Spanning Caterpillars Having at Most k Leaves
  11. Altmetric Badge
    Chapter 10 GDDs with Two Associate Classes and with Three Groups of Sizes 1, n , n and λ 1  
  12. Altmetric Badge
    Chapter 11 The Number of Diagonal Transformations in Quadrangulations on the Sphere
  13. Altmetric Badge
    Chapter 12 Remarks on Schur’s Conjecture
  14. Altmetric Badge
    Chapter 13 Greedy Approximation Algorithms for Generalized Maximum Flow Problem towards Relation Extraction in Information Networks
  15. Altmetric Badge
    Chapter 14 A Necessary and Sufficient Condition for a Bipartite Distance-Hereditary Graph to Be Hamiltonian
  16. Altmetric Badge
    Chapter 15 On Simplifying Deformation of Smooth Manifolds Defined by Large Weighted Point Sets
Attention for Chapter 14: A Necessary and Sufficient Condition for a Bipartite Distance-Hereditary Graph to Be Hamiltonian
Altmetric Badge

Citations

dimensions_citation
1 Dimensions
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
A Necessary and Sufficient Condition for a Bipartite Distance-Hereditary Graph to Be Hamiltonian
Chapter number 14
Book title
Computational Geometry and Graphs
Published by
Springer, Berlin, Heidelberg, January 2013
DOI 10.1007/978-3-642-45281-9_14
Book ISBNs
978-3-64-245280-2, 978-3-64-245281-9
Authors

Masahide Takasuga, Tomio Hirata, Takasuga, Masahide, Hirata, Tomio

View on publisher site

This page is provided by Altmetric.