scientific article; zbMATH DE number 1025912
From MaRDI portal
zbMath0873.05001MaRDI QIDQ4342632
Publication date: 24 June 1997
Full work available at URL: http://www.emis.de/monographs/Diestel/en/
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)
Related Items
A note on adjacent vertex distinguishing colorings of graphs, Hamiltonicity and generalised total colourings of planar graphs, Anti-Ramsey numbers in complete split graphs, Characterization of graphs associated with the ideal of numerical semigroups, Asymptotic periodicity of recurrent flows in infinite networks, Linear preservers for the \(q\)-permanent, cycle \(q\)-permanent expansions, and positive crossings in digraphs, Data center interconnection networks are not hyperbolic, Minimum cycle bases of direct products of complete graphs, On the hyperbolicity of bipartite graphs and intersection graphs, Random talk: Random walk and synchronizability in a moving neighborhood network, On the connectivity of minimum and minimal counterexamples to Hadwiger's conjecture, An improved bound for the monochromatic cycle partition number, Contractions, cycle double covers, and cyclic colorings in locally connected graphs, Hadwiger's conjecture for circular colorings of edge-weighted graphs, Fast recognition of classes of almost-median graphs, How to contract an essentially 6-connected graph to a 5-connected graph, The Brown-Colbourn conjecture on zeros of reliability polynomials is false, Old and new results on algebraic connectivity of graphs, A PTAS for the sparsest 2-spanner of 4-connected planar triangulations, Fixed-point-free embeddings of digraphs with small size, Distance constraints in graph color extensions, On the tropical Torelli map, The weak 3-flow conjecture and the weak circular flow conjecture, Bounds and relations involving adjusted centrality of the vertices of a tree, 1-planarity of complete multipartite graphs, Max-leaves spanning tree is APX-hard for cubic graphs, On \(k\)-con-critically \(n\)-connected graphs, Topological minors in graphs of large girth, Partitions of graphs with high minimum degree or connectivity., Edge-disjoint trees containing some given vertices in a graph, On random planar graphs, the number of planar graphs and their triangulations, On linear and circular structure of (claw, net)-free graphs, Application of computer algebra to Jones polynomials, A method on the matrix of graph of torus knot \(k(2,q)\) and its Maple application, Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphs, Conical and spherical graphs, Chordal embeddings of planar graphs, Robust consensus tracking of a class of second-order multi-agent dynamic systems, \(Z\)-transformation graphs of perfect matchings of plane bipartite graphs, On homomorphisms from the Hamming cube to \(\mathbb{Z}\), Cycles through a prescribed vertex set in \(n\)-connected graphs., Lorentz gas cellular automata on graphs., Controlling anonymous mobile agents with unidirectional locomotion to form formations on a circle, Finite-time coordination in multiagent systems using sliding mode control approach, Sparsest cuts and concurrent flows in product graphs., A note on the cyclical edge-connectivity of fullerene graphs, On upper bounds for parameters related to the construction of special maximum matchings, Total edge irregularity strength of large graphs, Turán numbers for disjoint copies of graphs, A revisit to the consensus for linearized Vicsek model under joint rooted leadership via a special matrix, Geometry of tropical moduli spaces and linkage of graphs, 2-rainbow domination number of Cartesian products: \(C_{n}\square C_{3}\) and \(C_{n}\square C_{5}\), On graphs associated to sets of rankings, Measures of edge-uncolorability of cubic graphs, Planar Ramsey numbers for cycles, Calculation of the number of all pairs of disjoint S-permutation matrices, The Cartesian product of cycles with small 2-rainbow domination number, Trees and languages with periodic signature, A note on the pure Morse complex of a graph, Cores of simplicial complexes, Avoiding rainbow 2-connected subgraphs, Triangle-free graphs whose independence number equals the degree, Formation control using range-only measurements, On \(H_\infty\) and \(H_2\) performance regions of multi-agent systems, Dynamic information handling in continuous time Boolean network model of gene interactions, Comparing perfect and 2nd Voronoi decompositions: the matroidal locus, An integrated algebraic approach to conflict resolution with three-level preference, Improved upper bounds for vertex cover, Measuring the confinement of probabilistic systems, Strong embeddings of minimum genus, The effect of points fattening on postulation, Stabilization of sets with application to multi-vehicle coordinated motion, Direct sum of distributive lattices on the perfect matchings of a plane bipartite graph, The parameterized complexity of editing graphs for bounded degeneracy, The signature of rational languages, Concerning the shape of a geometric lattice, A matrix-based approach to searching colored paths in a weighted colored multidigraph, The Erdös-Pósa property for matroid circuits, Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope, Markovian dynamics on complex reaction networks, Nowhere-zero 4-flow in almost Petersen-minor free graphs, Affine systems of equations and counting infinitary logic, Rainbow numbers for cycles with pendant edges, Menger's theorem for infinite graphs, On the \(k\)-orientability of random graphs, A note on \(k\)-connected rayless graphs, Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3, Computing sharp bounds for hard clustering problems on trees, The monadic second-order logic of graphs. XII: Planar graphs and planar maps, Edge-decompositions of highly connected graphs into paths, The monadic second-order logic of graphs. XIII: Graph drawings with edge crossings, Cliques, minors and apex graphs, A note on cycle spectra of line graphs, Choosability of \(K_5\)-minor-free graphs, The zero-divisor graph of a commutative ring, Excluding a countable clique, Planar graphs with circular chromatic numbers between 3 and 4, Highly connected sets and the excluded grid theorem, A family of sparse polynomial systems arising in chemical reaction systems, On equitable \(\Delta\)-coloring of graphs with low average degree, On characterization of maximal independent sets via quadratic optimization, Toughness and Hamiltonicity of a class of planar graphs, New formulae for the decycling number of graphs, Anti-Ramsey number of Hanoi graphs, Generating labeled planar graphs uniformly at random, Balanced allocation and dictionaries with tightly packed constant size bins, Combined Degree and Connectivity Conditions for $H$-Linked Graphs, Reductions of 3-connected graphs with minimum degree at least four, A broken circuit model for chromatic homology theories, Why there is no general solution to the problem of software verification, Nonseparating independent sets and maximum genus of graphs, Complete subgraphs in multipartite graphs, Game, set, and graph, An upper bound on the number of edges of a graph whose \(k\)th power has a connected complement, Applying clique-decomposition for computing Gromov hyperbolicity, Unnamed Item, Three-dimensional steerable discrete cosine transform with application to 3D image compression, A new formula for the decycling number of regular graphs, On the cardinality of a factor set of binary matrices, Linear quadratic optimal consensus of discrete-time multi-agent systems with optimal steady state: a distributed model predictive control approach, Harmonic synchronization under all three types of coupling: position, velocity, and acceleration, Non-contractible non-edges in 2-connected graphs, Some bounds on the generalised total chromatic number of degenerate graphs, Scaffolding skeletons using spherical Voronoi diagrams, Forbidden subgraphs of coloring graphs, On the separation profile of infinite graphs, Regular and vertex-transitive Kähler graphs having commutative principal and auxiliary adjacency operators, Graph classes generated by Mycielskians, Grad and classes with bounded expansion. III: Restricted graph homomorphism dualities, Identifying codes and watching systems in Kneser graphs, Finding unavoidable colorful patterns in multicolored graphs, Condensed matter physics, hybrid energy and entropy principles, and the hybrid first and second laws of thermodynamics, The monadic second-order logic of graphs. XI: Hierarchical decompositions of connected graphs, Decomposing graphs into paths of fixed length, 2-rainbow domination number of \(C_n\square C_5\), Algorithms for finding distance-edge-colorings of graphs, Distance invariant method for normalization of indexed differentials, Graphsof BCI/BCK -algebras, An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem, Lovász-Saks-Schrijver ideals and coordinate sections of determinantal varieties, A counterexample to the bipartizing matching conjecture, A GRAPH-THEORETIC ANALYSIS OF THE SEMANTIC PARADOXES, The full automorphism groups, determining sets and resolving sets of coprime graphs, On the predictability of discrete dynamical systems. III, Frame graph, Primitive one-factorizations and the geometry of mixed translations, Connectedness of the graph of vertex-colourings, The zero-divisor graph of an amalgamated algebra, Matchings in arbitrary groups., On distance-preserving elimination orderings in graphs: complexity and algorithms, Linear algebraic approach to an edge-coloring result, Semigroups for flows in infinite networks, Degree constrained subgraphs, The Y-triangle move does not preserve intrinsic knottedness, On-line graph coloring of \({\mathbb{P}_5}\)-free graphs, Line graphs for fractals, Localized patterns in homogeneous networks of diffusively coupled reactors, Limit sets of typical continuous functions, A mathematical analysis of Pāṇini's \textit{Śivasūtras}, Contractible edges in 7-connected graphs, On the pancyclicity of lexicographic products, List total colorings of series-parallel graphs, Local minima of quadratic forms on convex cones, A note on the Size-Ramsey number of long subdivisions of graphs, Directed path-width and monotonicity in digraph searching, Generalized Hamming weights of projective Reed-Muller-type codes over graphs, Design of test inputs and their sequences in multi-function system testing, Berge-Fulkerson coloring for some families of superposition snarks, On the number of 4-contractible edges in 4-connected graphs, Matching trees for simplicial complexes and homotopy type of devoid complexes of graphs, On the variety generated by completions of representable relation algebras, On a new extension of the zero-divisor graph. II, Distance-Based Clique Relaxations in Networks: s-Clique and s-Club, Minimum Cycle Bases and Their Applications, On density of subgraphs of halved cubes, Weighted expanders and the anisotropic Alon-Boppana theorem, Chromatic capacities of graphs and hypergraphs, Equitable edge partitions and Kirchhoff graphs, On some simplicial elimination schemes for chordal graphs, Graphs with the second signless Laplacian eigenvalue \(\leq 4\), The diameter of the zero-divisor graph of an amalgamated algebra, Rees algebras of filtrations of covering polyhedra and integral closure of powers of monomial ideals, The non-solvability by radicals of generic 3-connected planar Laman graphs, Chromatic-index-critical graphs of orders 13 and 14, On the maxima of Motzkin-Straus programs and cliques of graphs, Large planar subgraphs in dense graphs, Contractible subgraphs in 3-connected graphs, A degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph, All 4-connected line graphs of claw free graphs are Hamiltonian connected, Almost all 3-connected graphs contain a contractible set of \(k\) vertices, Disconnected 2-factors in planar cubic bridgeless graphs, Partitioning a graph into two pieces, each isomorphic to the other or to its complement, Inequalities involving the irredundance number of a graph, Subspace-based subspace sum graph on vector spaces, A note about shortest cycle covers, A Clustering-based Group Key Agreement Protocol for Ad-Hoc Networks, Long cycles in graphs and digraphs, Linear time algorithms for finding sparsest cuts in various graph classes, Perfect Clar structures and 3-homogeneous simplicial complexes, A subspace based subspace inclusion graph on vector space, On the predictability of discrete dynamical systems II, Unnamed Item, The full automorphism groups of general position graphs, Tutte polynomials for regular oriented matroids, Minimum separators and Menger's theorem, The extended graph of a module over a commutative ring, Quantum isomorphism of graphs from association schemes, An existence criterion for a cycle such that the vertices not included in it are independent, Algorithmic aspects of domination number in nano topology induced by graph, A new approach to the diameter of zero-divisor graph, Finding small complete subgraphs efficiently, Ramsey Goodness of Cycles, Associate class graph of zero-divisors of a commutative ring, The entire graph of a module with respect to a submodule, The Space Complexity of k-Tree Isomorphism, Unnamed Item, Constructing concrete hard instances of the maximum independent set problem, Unnamed Item, On betweenness-uniform graphs, On the total liar's domination of graphs, Induced Ramsey-type theorems, Induced Ramsey-type theorems, On the compressed essential graph of a module over a commutative ring, Graph Ramsey theory and the polynomial hierarchy, On Ramsey minimal graphs, A note on graphs with countable automorphism group, A special case of completion invariance for the $c_2$ invariant of a graph, Euclidean Eccentricity Transform by Discrete Arc Paving, Canonical varieties with no canonical axiomatisation, Unnamed Item, SOME RESULTS ON ANNIHILATING IDEAL GRAPH OF COMMUTATIVE RINGS, Unnamed Item, On the Space Between Critical Points, Regions of Reduced Dynamics in Dynamic Networks, A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs, Parameterized Algorithms for Generalized Domination, Routed planar networks, Graphs, friends and acquaintances, On graphs with same metric and upper dimension, Brilliance or steadiness? A suggestion of an alternative model to Hardy's model concerning golf (1945), PROJECTIVE REPRESENTATIONS OF A QUIVER WITH THREE VERTICES AND TWO EDGES AS R[x-MODULES], From graph theory to nano topology
