scientific article; zbMATH DE number 1025912

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 (only showing first 100 items - show all)

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

This page was built for publication: