scientific article; zbMATH DE number 1518742

zbMath0957.05001MaRDI QIDQ4507228

Reinhard Diestel

Publication date: 17 October 2000

Full work available at URL: http://www.emis.de/monographs/Diestel/de/

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Mathematics Subject Classification ID

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

Related Items (85)

Operations on independence numbers of certain graph classes ⋮ On computing the 2-vertex-connected components of directed graphs ⋮ Solving Problems on Graphs of High Rank-Width ⋮ Bilinear modeling solution approach for fixed charge network flow problems ⋮ Augmenting the algebraic connectivity for certain families of graphs ⋮ CHY-graphs on a torus ⋮ Constructing SAT Filters with a Quantum Annealer ⋮ Graph isomorphism parameterized by elimination distance to bounded degree ⋮ Parameterized Graph Cleaning Problems ⋮ Complete forcing numbers of primitive coronoids ⋮ A logic of reachable patterns in linked data-structures ⋮ On Compiling Structured CNFs to OBDDs ⋮ Recognizing IC-Planar and NIC-Planar Graphs ⋮ On Modulo Linked Graphs ⋮ On Finding Small 2-Generating Sets ⋮ The zero-divisor graph of a reduced ring ⋮ Colorings of the $d$-regular infinite tree ⋮ Extremal Betti numbers of symbolic powers of two-dimensional squarefree monomial ideals ⋮ Remarks on monotone multivalued mappings on a metric space with a graph ⋮ Parameterized complexity of fair deletion problems ⋮ Perfectness of a graph associated with annihilating ideals of a ring ⋮ An algorithm for a decomposition of weighted digraphs: with applications to life cycle analysis in ecology ⋮ Algorithmic Applications of Tree-Cut Width ⋮ Graph coloring applied to secure computation in non-abelian groups ⋮ A SAT Approach to Clique-Width ⋮ Mathematical representation of Clausius' and Kelvin's statements of the second law and irreversibility ⋮ The determinant of an antiadjacency matrix of a directed cycle graph with chords ⋮ All normalized anti-monotonic overlap graph measures are bounded ⋮ A computation of the Castelnuovo-Mumford regularity of certain two-dimensional unmixed ideals ⋮ On the level property of two-dimensional monomial ideals ⋮ On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs ⋮ Mixing 3-Colourings in Bipartite Graphs ⋮ Obtaining a Planar Graph by Vertex Deletion ⋮ The countable Erdős-Menger conjecture with ends ⋮ Coloring of cozero-divisor graphs of commutative von Neumann regular rings ⋮ Synchronization of power systems under stochastic disturbances ⋮ Isoperimetric Problem and Meta-fibonacci Sequences ⋮ Expander graphs and their applications ⋮ Patterns of patterns of synchronization: Noise induced attractor switching in rings of coupled nonlinear oscillators ⋮ Unnamed Item ⋮ Sufficient Conditions for a Connected Graph to Have a Hamiltonian Path ⋮ Enumerating Minimal Tropical Connected Sets ⋮ Finding Large Independent Sets in Line of Sight Networks ⋮ Parameterised temporal exploration problems ⋮ Longest (s, t)-paths in L-shaped grid graphs ⋮ Twin subgraphs and core-semiperiphery-periphery structures ⋮ Structural properties for certain classes of infinite planar graphs ⋮ On the comaximal ideal graph of a commutative ring ⋮ Computing Vertex-Surjective Homomorphisms to Partially Reflexive Trees ⋮ A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row ⋮ Topological solvability and DAE-index conditions for mass flow controlled pumps in liquid flow networks ⋮ Experiments with two heuristic algorithms for the maximum algebraic connectivity augmentation problem ⋮ Data-driven kriging models based on FANOVA-decomposition ⋮ Necessary condition for null controllability in many-server heavy traffic ⋮ A short proof of Halin's grid theorem ⋮ Finite rings with some restrictions on zero-divisor graphs. ⋮ The cycle space of a 3-connected locally finite graph is generated by its finite and infinite peripheral circuits ⋮ On Lyapunov stability of interconnected nonlinear systems: recursive integration methodology ⋮ Improved metaheuristics for the quartet method of hierarchical clustering ⋮ Computing Sharp 2-Factors in Claw-Free Graphs ⋮ Outlets of 2D invasion percolation and multiple-armed incipient infinite clusters ⋮ Suboptimal Fault Tolerant Control Design with the Use of Discrete Optimization ⋮ A Separator Theorem for String Graphs and Its Applications ⋮ From Graph Theory to Models of Economic Networks. A Tutorial ⋮ Colouring games based on autotopisms of Latin hyper-rectangles ⋮ Partitioning graphs into induced subgraphs ⋮ Edge importance in a network via line graphs and the matrix exponential ⋮ Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs ⋮ Covering Graphs with Few Complete Bipartite Subgraphs ⋮ The descriptive complexity of subgraph isomorphism without numerics ⋮ Parameterized Compilation Lower Bounds for Restricted CNF-Formulas ⋮ A SAT Approach to Branchwidth ⋮ Finding Cactus Roots in Polynomial Time ⋮ Maximum Motif Problem in Vertex-Colored Graphs ⋮ Unnamed Item ⋮ Empires Make Cartography Hard: The Complexity of the Empire Colouring Problem ⋮ AT-free graphs: Linear bounds for the oriented diameter ⋮ A combinatorial matrix approach for the generation of vacuum Feynman graphs multiplicities in $\phi^{4}$ theory ⋮ Graphs preserving Wiener index upon vertex removal ⋮ Cohen-Macaulay edge-weighted edge ideals of very well-covered graphs ⋮ Equitable colourings of Borel graphs ⋮ Fixed points of multivalued mappings in modular function spaces with a graph ⋮ Fixed points of monotone nonexpansive mappings on a hyperbolic metric space with a graph ⋮ Fixed points of monotone nonexpansive mappings with a graph ⋮ On Baire measurable colorings of group actions

This page was built for publication: