Graph Theory

DOI10.1007/978-3-662-53622-3zbMath1375.05002OpenAlexW4245608944MaRDI QIDQ2829286

Reinhard Diestel

Publication date: 27 October 2016

Published in: Graduate Texts in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53622-3

Mathematics Subject Classification ID

Ramsey theory (05D10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)

Related Items (only showing first 100 items - show all)

Improved upper bounds on longest-path and maximal-subdivision transversals ⋮ ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS ⋮ The minor order of homomorphisms via natural dualities ⋮ An algebraic formulation of hypergraph colorings ⋮ Distributed algorithms, the Lovász local lemma, and descriptive combinatorics ⋮ On the zombie number of various graph classes ⋮ Tree 3-spanners on generalized prisms of graphs ⋮ Non-Gorenstein locus and almost Gorenstein property of the Ehrhart ring of the stable set polytope of a cycle graph ⋮ Edge coloring of graphs of signed class 1 and 2 ⋮ Computing connected-\(k\)-subgraph cover with connectivity requirement ⋮ Detours in directed graphs ⋮ On reconfiguration graphs of independent sets under token sliding ⋮ A full characterization of invariant embeddability of unimodular planar graphs ⋮ An approximation algorithm for the clustered path travelling salesman problem ⋮ Listing the bonds of a graph in \(\widetilde{O} (n)\)-delay ⋮ Deletion to scattered graph classes. I: Case of finite number of graph classes ⋮ On graph norms for complex‐valued functions ⋮ Self‐adjoint and Markovian extensions of infinite quantum graphs ⋮ Edge-wise funnel output synchronization of heterogeneous agents with relative degree one ⋮ The structure of groups with all proper quotients virtually nilpotent ⋮ Maximally edge‐connected realizations and Kundu's k $k$‐factor theorem ⋮ Rooted minors and locally spanning subgraphs ⋮ Entanglements ⋮ On the Erdős–Pósa Property for Long Holes in \(\boldsymbol{C_4}\)-Free Graphs ⋮ Locally Finite ultrametric spaces and labeled trees ⋮ Zero-memory graph exploration with unknown inports ⋮ Formalising Szemerédi's Regularity Lemma and Roth's Theorem on Arithmetic Progressions in Isabelle/HOL ⋮ Solving infinite-domain CSPs using the patchwork property ⋮ A survey of parameterized algorithms and the complexity of edge modification ⋮ How far is my network from being edge-based? Proximity measures for edge-basedness of unrooted phylogenetic networks ⋮ A Cantor-Bendixson rank for siblings of trees ⋮ Induced subgraphs and path decompositions ⋮ Colorful graph coloring ⋮ Computing maximum matchings in temporal graphs ⋮ Hardness of bounding influence via graph modification ⋮ Balanced substructures in bicolored graphs ⋮ Sequentially swapping tokens: further on graph classes ⋮ Random cubic planar maps ⋮ Graph product structure for non-minor-closed classes ⋮ Local Hadwiger's conjecture ⋮ Visibility representations of toroidal and Klein-bottle graphs ⋮ The linkedness of cubical polytopes: beyond the cube ⋮ Some conditions for Hamiltonian cycles in 1-tough \((K_2 \cup kK_1)\)-free graphs ⋮ Maximal independent sets, variants of chain/antichain principle and cofinal subsets without AC ⋮ Covering monotonicity of the limit shapes of first passage percolation on crystal lattices ⋮ Succinct data structure for path graphs ⋮ Quasidiagonal weighted shifts on directed trees ⋮ THE STRENGTH OF AN AXIOM OF FINITE CHOICE FOR BRANCHES IN TREES ⋮ Maximizing Graovac-Ghorbani Index of Trees with Fixed Maximum Degree ⋮ Parameterized algorithms for eccentricity shortest path problem ⋮ Make a graph singly connected by edge orientations ⋮ The regularity of almost all edge ideals ⋮ Some new algorithmic results on co-secure domination in graphs ⋮ Planar graphs with the maximum number of induced 6-cycles ⋮ Minimum degree of minimal \((n-10)\)-factor-critical graphs ⋮ Upper bounds on the acyclic chromatic index of degenerate graphs ⋮ A unified half‐integral Erdős–Pósa theorem for cycles in graphs labelled by multiple abelian groups ⋮ Maximizing Social Welfare in Score-Based Social Distance Games ⋮ Minor embedding in broken chimera and derived graphs is NP-complete ⋮ Eulerian Spaces ⋮ Feedback game on \(3\)-chromatic Eulerian triangulations of surfaces ⋮ Gluing Karcher-Scherk saddle towers. I: Triply periodic minimal surfaces ⋮ graph ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The problem of path decomposition for graphs with treewidth at most 4 ⋮ New Width Parameters for Independent Set: One-Sided-Mim-Width and Neighbor-Depth ⋮ Parameterized Complexity of Broadcasting in Graphs ⋮ Efficiently distinguishing all tangles in locally finite graphs ⋮ The Arnold conjecture for singular symplectic manifolds ⋮ Can Romeo and Juliet meet? Or rendezvous games with adversaries on graphs ⋮ Duality Theorems for Blocks and Tangles in Graphs ⋮ A note on semicompleteness of graph products of abelian groups ⋮ A Formal Model for Polarization under Confirmation Bias in Social Networks ⋮ Classes of graphs embeddable in order-dependent surfaces ⋮ Period collapse in Ehrhart quasi-polynomials of \(\{1,3\}\)-graphs ⋮ Even circuits in oriented matroids ⋮ Application of a Distributed Containment Algorithm: Trajectory Tracking for Mobile Robots ⋮ $n$-Arc connected graphs ⋮ Geometry and Combinatorics via Right-Angled Artin Groups ⋮ Chromatic uniqueness of zero-divisor graphs ⋮ Totally ramified rational maps ⋮ Digraphs and Variable Degeneracy ⋮ Continuous Rendezvous Algorithm for Memoryless Agents with Limited Visibility in the Euclidean Space ⋮ THEOREMS OF HYPERARITHMETIC ANALYSIS AND ALMOST THEOREMS OF HYPERARITHMETIC ANALYSIS ⋮ UNIT AND UNITARY CAYLEY GRAPHS FOR THE RING OF EISENSTEIN INTEGERS MODULO \(n\) ⋮ Levelness versus almost Gorensteinness of edge rings of complete multipartite graphs ⋮ LDPC codes from cubic semisymmetric graphs ⋮ Simultaneously dominating all spanning trees of a graph ⋮ Throttling for standard zero forcing on directed graphs ⋮ Ramsey properties of products of chains ⋮ An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength ⋮ Properties of Large 2-Crossing-Critical Graphs ⋮ Linkedness of Cartesian products of complete graphs ⋮ Trees of tangles in infinite separation systems ⋮ \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions ⋮ Embedding clique-factors in graphs with low \(\ell\)-independence number ⋮ Parameterized complexity of perfectly matched sets ⋮ An approximation algorithm for the clustered path travelling salesman problem

This page was built for publication: Graph Theory