Graph theory
From MaRDI portal
Publication:2829286
DOI10.1007/978-3-662-53622-3zbMATH Open1375.05002OpenAlexW4245608944MaRDI QIDQ2829286FDOQ2829286
Authors: 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
Recommendations
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Ramsey theory (05D10) Graph theory (05Cxx)
Cited In (only showing first 100 items - show all)
- Enlarging vertex-flames in countable digraphs
- Disjoint cycles covering specified vertices in bipartite graphs with partial degrees
- Lower bounds and properties for the average number of colors in the non-equivalent colorings of a graph
- Weak degeneracy of graphs
- An algebraic formulation of hypergraph colorings
- Tangle-tree duality in abstract separation systems
- New constructions of divisible design Cayley graphs
- A lower bound on the zero forcing number
- Proximity semantics for topic-based abstract argumentation
- Planarity of Cayley graphs of graph products of groups
- On the role of 3's for the 1-2-3 conjecture
- \(n\)-arc connected graphs
- Rooted complete minors in line graphs with a Kempe coloring
- Divisible design Cayley digraphs
- The Dirichlet problem for orthodiagonal maps
- \(k\)-apices of minor-closed graph classes. I: Bounding the obstructions
- Connections between graphs and matrix spaces
- The linkedness of cubical polytopes: the cube
- Duality theorems for blocks and tangles in graphs
- On coherence of graph products of groups and Coxeter groups
- Forbidden subgraphs and 2‐factors in 3/2‐tough graphs
- On Euclidean distances and sphere representations
- Bottleneck subset-type restricted matching problems
- Computability theory. Abstracts from the workshop held April 25 -- May 1, 2021 (hybrid meeting)
- Approximating shortest connected graph transformation for trees
- Title not available (Why is that?)
- Parameterized algorithms for book embedding problems
- A logical study of group-size based social network creation
- A characterization of trees based on edge-deletion and its applications for domination-type invariants
- Complexity of tree-coloring interval graphs equitably
- Solving partition problems almost always requires pushing many vertices around
- Equitable list tree-coloring of bounded treewidth graphs
- A new proof of Balinski's theorem on the connectivity of polytopes
- Improved bounds on the Ramsey number of fans
- Finite rings with Eulerian nilpotent graphs
- Fractal dimension and lower bounds for geometric problems
- Entire functions arising from trees
- Reversible Markov decision processes and the Gaussian free field
- Parameterized algorithms for book embedding problems
- The geometry of partial fitness orders and an efficient method for detecting genetic interactions
- Distribution of contractible edges and the structure of noncontractible edges having endvertices with large degree in a 4-connected graph
- Simplicity of augmentation submodules for transformation monoids
- Achromatic number and facial achromatic number of connected locally-connected graphs
- Consensus and voting on large graphs: an application of graph limit theory
- Building large \(k\)-cores from sparse graphs
- Group-theoretic generalisations of vertex and edge connectivities
- Extremum seeking based fault-tolerant cooperative control for multiagent systems
- A Ramsey-type theorem for the matching number regarding connected graphs
- Deleting vertices to graphs of bounded genus
- Minimal obstructions for normal spanning trees
- Parameterized complexity of perfectly matched sets
- Faster algorithms for counting subgraphs in sparse graphs
- New limits of treewidth-based tractability in optimization
- Mathematical programming formulations for the alternating current optimal power flow problem
- Throttling for standard zero forcing on directed graphs
- Packing and covering induced subdivisions
- An approximation algorithm for the clustered path travelling salesman problem
- An approximation algorithm for the clustered path travelling salesman problem
- Hitting forbidden induced subgraphs on bounded treewidth graphs
- Self‐adjoint and Markovian extensions of infinite quantum graphs
- Acyclic chromatic index of chordless graphs
- Lipschitz-free spaces on finite metric spaces
- A Formal Model for Polarization under Confirmation Bias in Social Networks
- Finding temporal paths under waiting time constraints
- Seminormality, canonical modules, and regularity of cut polytopes
- Existence of a spanning tree having small diameter
- Colorful graph coloring
- Monotonic core allocation paths for assignment games
- Treewidth is a lower bound on graph gonality
- Upper tails via high moments and entropic stability
- Identifiability of local and global features of phylogenetic networks from average distances
- Groups of \(p\)-absolute Galois type that are not absolute Galois groups
- Distributed distance-\(r\) covering problems on sparse high-girth graphs
- Minimal induced subgraphs of the class of 2-connected non-Hamiltonian wheel-free graphs
- Antimagic labeling of biregular bipartite graphs
- Three families of toric rings arising from posets or graphs with small class groups
- Trees of tangles in abstract separation systems
- The distance matching extension in \(K_{1,k}\)-free graphs with high local connectedness
- All subgraphs of a wheel are 5-coupled-choosable
- Sums of squares and quadratic persistence on real projective varieties
- Tree 3-spanners on generalized prisms of graphs
- On algorithmic Coxeter spectral analysis of positive posets
- On a colored Turán problem of Diwan and Mubayi
- Uncountably many minimal hereditary classes of graphs of unbounded clique-width
- Uniform orderings for generalized coloring numbers
- Proof of Halin's normal spanning tree conjecture
- Kernelization and approximation of distance-\(r\) independent sets on nowhere dense graphs
- On Dasgupta's hierarchical clustering objective and its relation to other graph parameters
- Graph invariants of the line graph of zero divisor graph of \(\mathbb{Z}_n \)
- In absence of long chordless cycles, large tree-width becomes a local phenomenon
- Port-Hamiltonian formulation of nonlinear electrical circuits
- Finding Temporal Paths Under Waiting Time Constraints.
- Title not available (Why is that?)
- Aspects of topological approaches for data science
- Computing maximum matchings in temporal graphs
- Linear bounds for cycle-free saturation games
- Bears with hats and independence polynomials
- Distance matching extension in cubic bipartite graphs
- Edge exploration of temporal graphs
- Analysis on Laakso graphs with application to the structure of transportation cost spaces
This page was built for publication: Graph theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829286)
