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