Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Advanced Graph Theory / / by Santosh Kumar Yadav
| Advanced Graph Theory / / by Santosh Kumar Yadav |
| Autore | Yadav Santosh Kumar |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (294 pages) |
| Disciplina |
574
511.5 |
| Soggetto topico |
Graph theory
Discrete mathematics Graph Theory Applications of Discrete Mathematics Discrete Mathematics Teoria de grafs |
| Soggetto genere / forma | Llibres electrònics |
| ISBN | 3-031-22562-7 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Introduction -- Trees -- Planar Graphs -- Directed Graphs -- Matching and Covering -- Colouring of Graphs -- Enumeration and Pölya’s Theorem -- Spectral Properties of Graph -- Emerging Trends in Graph Theory. |
| Record Nr. | UNINA-9910731471503321 |
Yadav Santosh Kumar
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms and Discrete Applied Mathematics [[electronic resource] ] : 7th International Conference, CALDAM 2021, Rupnagar, India, February 11–13, 2021, Proceedings / / edited by Apurva Mudgal, C. R. Subramanian
| Algorithms and Discrete Applied Mathematics [[electronic resource] ] : 7th International Conference, CALDAM 2021, Rupnagar, India, February 11–13, 2021, Proceedings / / edited by Apurva Mudgal, C. R. Subramanian |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (519 pages) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Algorithms Data structures (Computer science) Information theory Mathematics—Data processing Mathematics of Computing Design and Analysis of Algorithms Data Structures and Information Theory Computational Mathematics and Numerical Analysis Algorismes Geometria Teoria de grafs |
| Soggetto genere / forma |
Congressos
Llibres electrònics |
| ISBN | 3-030-67899-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Approximation Algorithms -- Online bin packing with overload cost -- Scheduling Trains with Small Stretch on a Unidirectional Line -- Algorithmic Aspects of Total Roman and Total Double Roman Domination in Graphs -- Approximation Algorithms for Orthogonal Line Centers -- Semitotal Domination on AT-free Graphs and Circle Graphs -- Burning Grids and Intervals -- Parameterized Algorithms -- On Parameterized Complexity of Liquid Democracy -- Acyclic coloring parameterized by directed clique-width. - On Structural Parameterizations of Load Coloring -- One-Sided Discrete Terrain Guarding and Chordal Graphs -- Parameterized Complexity of Locally Minimal Defensive Alliances -- Computational Geometry -- New variants of Perfect Non-crossing Matchings -- Cause I’m a Genial Imprecise Point: Outlier Detection for Uncertain Data -- A Worst-case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes -- On the Intersections of Non-homotopic Loops -- Graph Theory -- On cd-coloring of trees and co-bipartite graphs -- Cut Vertex Transit Functions of Hypergraphs -- Lexicographic Product of Digraphs and Related Boundary-Type Sets -- The Connected Domination Number of Grids -- On degree sequences and eccentricities in pseudoline arrangement graphs. - Cops and Robber on Butterflies and Solid Grids -- b-Coloring of Some Powers of Hypercubes -- Chromatic Bounds for the Subclasses of $pK_2$ -Free Graphs -- Axiomatic characterization of the median function of a block graph -- On Coupon Coloring of Cartesian Product of Some Graphs -- On the Connectivity and the Diameter of Betweenness-Uniform Graphs. -Combinatorics and Algorithms -- On algorithms to find p-ordering -- Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem -- Algorithmic analysis of priority-based bin packing -- Recursive methods for some problems in coding and random permutations -- Achieving positive rates with predetermined dictionaries -- Characterization of Dense Patterns Having Distinct Squares -- Graph Algorithms -- Failure and communication in a synchronized multi-drone system -- Memory Optimal Dispersion by Anonymous Mobile Robots -- Quantum and approximation algorithms for maximum witnesses of Boolean matrix products. -Template-driven Rainbow Coloring of Proper Interval Graphs -- Minimum Consistent Subset of Simple Graph Classes. - Computational Complexity -- Balanced Connected Graph Partition -- Hardness Results of Global Roman Domination in Graphs. . |
| Record Nr. | UNISA-996464385203316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and Discrete Applied Mathematics : 7th International Conference, CALDAM 2021, Rupnagar, India, February 11–13, 2021, Proceedings / / edited by Apurva Mudgal, C. R. Subramanian
| Algorithms and Discrete Applied Mathematics : 7th International Conference, CALDAM 2021, Rupnagar, India, February 11–13, 2021, Proceedings / / edited by Apurva Mudgal, C. R. Subramanian |
| Edizione | [1st ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (519 pages) |
| Disciplina | 004.0151 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer science—Mathematics
Algorithms Data structures (Computer science) Information theory Mathematics—Data processing Mathematics of Computing Design and Analysis of Algorithms Data Structures and Information Theory Computational Mathematics and Numerical Analysis Algorismes Geometria Teoria de grafs |
| Soggetto genere / forma |
Congressos
Llibres electrònics |
| ISBN | 3-030-67899-7 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Approximation Algorithms -- Online bin packing with overload cost -- Scheduling Trains with Small Stretch on a Unidirectional Line -- Algorithmic Aspects of Total Roman and Total Double Roman Domination in Graphs -- Approximation Algorithms for Orthogonal Line Centers -- Semitotal Domination on AT-free Graphs and Circle Graphs -- Burning Grids and Intervals -- Parameterized Algorithms -- On Parameterized Complexity of Liquid Democracy -- Acyclic coloring parameterized by directed clique-width. - On Structural Parameterizations of Load Coloring -- One-Sided Discrete Terrain Guarding and Chordal Graphs -- Parameterized Complexity of Locally Minimal Defensive Alliances -- Computational Geometry -- New variants of Perfect Non-crossing Matchings -- Cause I’m a Genial Imprecise Point: Outlier Detection for Uncertain Data -- A Worst-case Optimal Algorithm to Compute the Minkowski Sum of Convex Polytopes -- On the Intersections of Non-homotopic Loops -- Graph Theory -- On cd-coloring of trees and co-bipartite graphs -- Cut Vertex Transit Functions of Hypergraphs -- Lexicographic Product of Digraphs and Related Boundary-Type Sets -- The Connected Domination Number of Grids -- On degree sequences and eccentricities in pseudoline arrangement graphs. - Cops and Robber on Butterflies and Solid Grids -- b-Coloring of Some Powers of Hypercubes -- Chromatic Bounds for the Subclasses of $pK_2$ -Free Graphs -- Axiomatic characterization of the median function of a block graph -- On Coupon Coloring of Cartesian Product of Some Graphs -- On the Connectivity and the Diameter of Betweenness-Uniform Graphs. -Combinatorics and Algorithms -- On algorithms to find p-ordering -- Experimental Evaluation of a Local Search Approximation Algorithm for the Multiway Cut Problem -- Algorithmic analysis of priority-based bin packing -- Recursive methods for some problems in coding and random permutations -- Achieving positive rates with predetermined dictionaries -- Characterization of Dense Patterns Having Distinct Squares -- Graph Algorithms -- Failure and communication in a synchronized multi-drone system -- Memory Optimal Dispersion by Anonymous Mobile Robots -- Quantum and approximation algorithms for maximum witnesses of Boolean matrix products. -Template-driven Rainbow Coloring of Proper Interval Graphs -- Minimum Consistent Subset of Simple Graph Classes. - Computational Complexity -- Balanced Connected Graph Partition -- Hardness Results of Global Roman Domination in Graphs. . |
| Record Nr. | UNINA-9910483693803321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms on Trees and Graphs : With Python Code / / by Gabriel Valiente
| Algorithms on Trees and Graphs : With Python Code / / by Gabriel Valiente |
| Autore | Valiente Gabriel <1963-> |
| Edizione | [2nd ed. 2021.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 |
| Descrizione fisica | 1 online resource (392 pages) |
| Disciplina | 511.5 |
| Collana | Texts in Computer Science |
| Soggetto topico |
Computer science - Mathematics
Discrete mathematics Algorithms Graph theory Python (Computer program language) C++ (Computer program language) Discrete Mathematics in Computer Science Graph Theory Python C++ Teoria de grafs |
| Soggetto genere / forma | Llibres electrònics |
| ISBN | 3-030-81885-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1. Introduction -- 2. Algorithmic Techniques -- 3. Tree Traversal -- 4. Tree Isomorphism -- 5. Graph Traversal -- 6. Clique, Independent Set, and Vertex Cover -- 7. Graph Isomorphism. |
| Record Nr. | UNINA-9910502982803321 |
|
Valiente Gabriel <1963->
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2021 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Brooks' Theorem : Graph Coloring and Critical Graphs / / by Michael Stiebitz, Thomas Schweser, Bjarne Toft
| Brooks' Theorem : Graph Coloring and Critical Graphs / / by Michael Stiebitz, Thomas Schweser, Bjarne Toft |
| Autore | Stiebitz Michael <1954-> |
| Edizione | [1st ed. 2024.] |
| Pubbl/distr/stampa | Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 |
| Descrizione fisica | 1 online resource (663 pages) |
| Disciplina | 511.56 |
| Collana | Springer Monographs in Mathematics |
| Soggetto topico |
Graph theory
Graph Theory Teoria de grafs |
| Soggetto genere / forma | Llibres electrònics |
| ISBN |
9783031500657
3031500652 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | 1 Degree Bounds for the Chromatic Number -- 2 Degeneracy and Colorings -- 3 Colorings and Orientations of Graphs -- 4 Properties of Critical Graphs -- 5 Critical Graphs with few Edges -- 6 Bounding χ by ∆ and ω -- 7 Coloring of Hypergraphs -- 8 Homomorphisms and Colorings -- 9 Coloring Graphs on Surface -- Appendix A: Brooks’ Fundamental Paper -- Appendix B: Tutte’s Lecture from 1992 -- Appendix C: Basic Graph Theory Concepts. |
| Record Nr. | UNINA-9910845082203321 |
|
Stiebitz Michael <1954->
|
||
| Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2024 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Combinatorics, Graph Theory and Computing [[electronic resource] ] : SEICCGTC 2020, Boca Raton, USA, March 9–13 / / edited by Frederick Hoffman
| Combinatorics, Graph Theory and Computing [[electronic resource] ] : SEICCGTC 2020, Boca Raton, USA, March 9–13 / / edited by Frederick Hoffman |
| Edizione | [1st ed. 2022.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 |
| Descrizione fisica | 1 online resource (327 pages) |
| Disciplina | 511.6 |
| Collana | Springer Proceedings in Mathematics & Statistics |
| Soggetto topico |
Discrete mathematics
Graph theory Algebraic fields Polynomials Computer science - Mathematics Convex geometry Discrete geometry Discrete Mathematics Graph Theory Field Theory and Polynomials Discrete Mathematics in Computer Science Convex and Discrete Geometry Anàlisi combinatòria Teoria de grafs |
| Soggetto genere / forma |
Congressos
Llibres electrònics |
| ISBN |
9783031053757
9783031053740 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Ratio Balancing Numbers(Bartz et al) -- An Unexpected Digit Permutation from Multiplying in any Number Base(Qu et al) -- A & Z Sequences for Double Riordan Arrays (Branch et al) -- Constructing Clifford Algebras for Windmill and Dutch Windmill Graphs; A New Proof of The Friendship Theorem(Myers) -- Finding Exact Values of a Character Sum (Peart et al) -- On Minimum Index Stanton 4-cycle Designs (Bunge et al) -- k-Plane Matroids and Whiteley’s Flattening Conjectures (Servatius et al) -- Bounding the edge cover of a hypergraph (Shahrokhi) -- A Generalization on Neighborhood Representatives (Holliday) -- Harmonious Labelings of Disconnected Graphs involving Cycles and Multiple Components Consisting of Starlike Trees(Abueida et al) -- On Rainbow Mean Colorings of Trees (Hallas et al) -- Examples of Edge Critical Graphs in Peg Solitaire (Beeler et al) -- Regular Tournaments with Minimum Split Domination Number and Cycle Extendability (Factor et al) -- Independence and Domination of Chess Pieces on Triangular Boards and on the Surface of a Tetrahedron(Munger et al) -- Efficient and Non-efficient Domination of Z-stacked Archimedean Lattices (Paskowitz et al) -- On subdivision graphs which are 2-steps Hamiltonian graphs and hereditary non 2-steps Hamiltonian graphs (Lee et al) -- On the Erd}os-S_os Conjecture for graphs with circumference at most k + 1 (Heissan et al) -- Regular graph and some vertex-deleted subgraph (Egawa et al) -- Connectivity and Extendability in Digraphs (Beasle) -- On the extraconnectivity of arrangement graphs (Cheng et al) -- k-Paths of k-Trees(Bickle) -- Rearrangement of the Simple Random Walk(Skyers et al) -- On the Energy of Transposition Graphs(DeDeo) -- A Smaller Upper Bound for the (4; 82) Lattice Site Percolation Threshold(Wierman). |
| Record Nr. | UNISA-996490346803316 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Combinatorics, Graph Theory and Computing : SEICCGTC 2020, Boca Raton, USA, March 9–13 / / edited by Frederick Hoffman
| Combinatorics, Graph Theory and Computing : SEICCGTC 2020, Boca Raton, USA, March 9–13 / / edited by Frederick Hoffman |
| Edizione | [1st ed. 2022.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 |
| Descrizione fisica | 1 online resource (327 pages) |
| Disciplina | 511.6 |
| Collana | Springer Proceedings in Mathematics & Statistics |
| Soggetto topico |
Discrete mathematics
Graph theory Algebraic fields Polynomials Computer science - Mathematics Convex geometry Discrete geometry Discrete Mathematics Graph Theory Field Theory and Polynomials Discrete Mathematics in Computer Science Convex and Discrete Geometry Anàlisi combinatòria Teoria de grafs |
| Soggetto genere / forma |
Congressos
Llibres electrònics |
| ISBN |
9783031053757
9783031053740 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Ratio Balancing Numbers(Bartz et al) -- An Unexpected Digit Permutation from Multiplying in any Number Base(Qu et al) -- A & Z Sequences for Double Riordan Arrays (Branch et al) -- Constructing Clifford Algebras for Windmill and Dutch Windmill Graphs; A New Proof of The Friendship Theorem(Myers) -- Finding Exact Values of a Character Sum (Peart et al) -- On Minimum Index Stanton 4-cycle Designs (Bunge et al) -- k-Plane Matroids and Whiteley’s Flattening Conjectures (Servatius et al) -- Bounding the edge cover of a hypergraph (Shahrokhi) -- A Generalization on Neighborhood Representatives (Holliday) -- Harmonious Labelings of Disconnected Graphs involving Cycles and Multiple Components Consisting of Starlike Trees(Abueida et al) -- On Rainbow Mean Colorings of Trees (Hallas et al) -- Examples of Edge Critical Graphs in Peg Solitaire (Beeler et al) -- Regular Tournaments with Minimum Split Domination Number and Cycle Extendability (Factor et al) -- Independence and Domination of Chess Pieces on Triangular Boards and on the Surface of a Tetrahedron(Munger et al) -- Efficient and Non-efficient Domination of Z-stacked Archimedean Lattices (Paskowitz et al) -- On subdivision graphs which are 2-steps Hamiltonian graphs and hereditary non 2-steps Hamiltonian graphs (Lee et al) -- On the Erd}os-S_os Conjecture for graphs with circumference at most k + 1 (Heissan et al) -- Regular graph and some vertex-deleted subgraph (Egawa et al) -- Connectivity and Extendability in Digraphs (Beasle) -- On the extraconnectivity of arrangement graphs (Cheng et al) -- k-Paths of k-Trees(Bickle) -- Rearrangement of the Simple Random Walk(Skyers et al) -- On the Energy of Transposition Graphs(DeDeo) -- A Smaller Upper Bound for the (4; 82) Lattice Site Percolation Threshold(Wierman). |
| Record Nr. | UNINA-9910595024203321 |
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2022 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Conceptual structures : common semantics for sharing knowledge : 13th International Conference on Conceptual Structures, ICCS 2005, Kassel, Germany, July 17-22, 2005 : proceedings / / Frithjof Dau, Marie-Laure Mugnier, Gerd Stumme (eds.)
| Conceptual structures : common semantics for sharing knowledge : 13th International Conference on Conceptual Structures, ICCS 2005, Kassel, Germany, July 17-22, 2005 : proceedings / / Frithjof Dau, Marie-Laure Mugnier, Gerd Stumme (eds.) |
| Edizione | [1st ed. 2005.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2005 |
| Descrizione fisica | 1 online resource (XI, 467 p.) |
| Disciplina | 003.54 |
| Altri autori (Persone) |
DauFrithjof
MugnierMarie-Laure StummeGerd <1967-> |
| Collana | Lecture notes in computer science : subseries of Lecture notes in artificial intelligence |
| Soggetto topico |
Conceptual structures (Information theory)
Graph theory Logic diagrams Knowledge representation (Information theory) Natural language processing (Computer science) Estructures conceptuals (Teoria de la informació) Teoria de grafs |
| Soggetto genere / forma |
Congressos
Llibres electrònics |
| ISBN |
9783540318859
3540318852 9783540277835 3540277838 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Invited Papers -- Patterns for the Pragmatic Web -- Conceptual Graphs for Semantic Web Applications -- Knowledge Representation and Reasoning in (Controlled) Natural Language -- What Is a Concept? -- Applications of Description Logics: State of the Art and Research Challenges -- Methodologies for the Reliable Construction of Ontological Knowledge -- Using Formal Concept Analysis and Information Flow for Modelling and Sharing Common Semantics: Lessons Learnt and Emergent Issues -- On the Need to Bootstrap Ontology Learning with Extraction Grammar Learning -- Conzilla — A Conceptual Interface to the Semantic Web -- Theoretical Foundations -- Variables in Concept Graphs -- Arbitrary Relations in Formal Concept Analysis and Logical Information Systems -- Merge-Based Computation of Minimal Generators -- Representation of Data Contexts and Their Concept Lattices in General Geometric Spaces -- Local Negation in Concept Graphs -- Morphisms in Context -- Contextual Logic and Aristotle’s Syllogistic -- States of Distributed Objects in Conceptual Semantic Systems -- Knowledge Engineering and Tools -- Hierarchical Knowledge Integration Using Layered Conceptual Graphs -- Evaluation of Concept Lattices in a Web-Based Mail Browser -- D-SIFT: A Dynamic Simple Intuitive FCA Tool -- Analyzing Conflicts with Concept-Based Learning -- Querying a Bioinformatic Data Sources Registry with Concept Lattices -- How Formal Concept Lattices Solve a Problem of Ancient Linguistics -- A New Method to Interrogate and Check UML Class Diagrams -- Knowledge Acquisition and Ontologies -- Language Technologies Meet Ontology Acquisition -- Weighted Pseudo-distances for Categorization in Semantic Hierarchies -- Games of Inquiry for Collaborative Concept Structuring -- Toward Cooperatively-Built Knowledge Repositories -- What Has Happened to Ontology -- Enhancing the Initial Requirements Capture of Multi-Agent Systems Through Conceptual Graphs -- Outline of trikonic?* k: Diagrammatic Trichotomic. |
| Record Nr. | UNINA-9910485024403321 |
| Berlin ; ; New York, : Springer, c2005 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Discrete Mathematics with Graph Theory / / by Santosh Kumar Yadav
| Discrete Mathematics with Graph Theory / / by Santosh Kumar Yadav |
| Autore | Yadav Santosh Kumar |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023 |
| Descrizione fisica | 1 online resource (XX, 648 p. 265 illus.) |
| Disciplina | 511.1 |
| Soggetto topico |
Discrete mathematics
Graph theory Discrete Mathematics Graph Theory Applications of Discrete Mathematics Matemàtica discreta Teoria de grafs |
| Soggetto genere / forma | Llibres electrònics |
| ISBN | 3-031-21321-1 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Preliminaries -- The languages of Sets -- Basic Combinatorics -- Mathematical Logic -- Relations -- Functions -- Lattice Theory -- Boolean Algebra and Applications -- Fuzzy Algebra -- Formal Languages and Automata Theory -- The Basics of Graph Theory -- Trees -- Planar Graphs -- Directed Graphs -- Matching and Covering -- Coloring of Graphs. . |
| Record Nr. | UNINA-9910735090703321 |
|
Yadav Santosh Kumar
|
||
| Cham : , : Springer International Publishing : , : Imprint : Springer, , 2023 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Domination games played on graphs / / Boéstjan Breésar [and three others]
| Domination games played on graphs / / Boéstjan Breésar [and three others] |
| Autore | Breésar Boéstjan |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2021] |
| Descrizione fisica | 1 online resource (131 pages) |
| Disciplina | 793.74 |
| Collana | SpringerBriefs in Mathematics |
| Soggetto topico |
Graph theory
Teoria de grafs Matemàtica recreativa |
| Soggetto genere / forma | Llibres electrònics |
| ISBN | 3-030-69087-3 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Record Nr. | UNISA-996466554103316 |
|
Breésar Boéstjan
|
||
| Cham, Switzerland : , : Springer, , [2021] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Soggetto topico
-
Teoria de grafs
(40)
- Graph theory (31)
- Graph Theory (10)
- Discrete mathematics (9)
- Computer science - Mathematics (6)