Publication:4398864
From MaRDI portal
zbMath0902.05016MaRDI QIDQ4398864
Publication date: 28 July 1998
05Cxx: Graph theory
Related Items
On the distribution of the domination number for random class cover catch digraphs, On certain Coxeter lattices without perfect sections, The interlace polynomial of a graph, Counting nilpotent endomorphisms, The effect on the Laplacian spectral radius of a graph by adding or grafting edges, Eigenvalues and degree deviation in graphs, Sublattices of certain Coxeter lattices, Walks and the spectral radius of graphs, Eulerian colorings and the bipartizing matchings conjecture of Fleischner, Non-bipartiteness of graphs and the upper bounds of Dirichlet forms, Defining matroids through sequential selection, Robust kernel Isomap, Networks based on collisions among mobile agents, Graphs and matrices with maximal energy, On the spectral radius of unicyclic graphs with fixed diameter, Bounds on graph eigenvalues. I, Edge-bandwidth of grids and tori, The degree distribution of the generalized duplication model, Enumeration of subtrees of trees, On the edge \(l_{\infty }\) radius of Saitou and Nei's method for phylogenetic reconstruction, Optimization problems of the third edge-connectivity of graphs, The energy of graphs and matrices, Eigenvalues and extremal degrees of graphs, Eigenvalue problems of Nordhaus--Gaddum type, Making the components of a graph \(k\)-connected, Eigenvalues and forbidden subgraphs. I., On the upper bounds of the numbers of perfect matchings in graphs with given parameters, Coalescent random walks on graphs, A degree constraint for uniquely Hamiltonian graphs, Clustering of spectra and fractals of regular graphs, Tutte's barycenter method applied to isotopies, An application of Ramsey theorem to stopping games., Hamiltonian double Latin squares, Ramsey numbers involving large dense graphs and bipartite Turán numbers, Graphs with large maximum degree containing no odd cycles of a given length, Zeros of the Jones polynomials for families of pretzel links, Nearly bipartite graphs, Partial immunization processes, Free energy as a dynamical invariant (or can you hear the shape of a potential?), Semidirect product constructions of directed strongly regular graphs, Extremal problems for ordered (hyper)graphs: Applications of Davenport-Schinzel sequences, The expected hitting times for graphs with cutpoints., On the number of edges not covered by monochromatic copies of a fixed graph., On homomorphisms from the Hamming cube to \(\mathbb{Z}\), Identities for circuit partition polynomials, with applications to the Tutte polynomial, On the algebraic complexity of some families of coloured Tutte polynomials, Connections between loops of exponent 2, reflection structures and complete graphs with parallelism, Exact Potts model partition function on strips of the triangular lattice, Graph-theoretical characterization of invertible cellular automata, 4-edge-coloring graphs of maximum degree 3 in linear time, Wavelength routing in optical networks of diameter two, Graphs and Hermitian matrices: eigenvalue interlacing, Super restricted edge-connectivity of vertex-transitive graphs, Efficiency test of pseudorandom number generators using random walks, Books in graphs, Small sets and Markov transition densities., Parallel connections and coloured Tutte polynomials, The Kauffman brackets for equivalence classes of links, A hypergraph extension of the bipartite Turán problem, Random walks on a finite graph with congestion points, Weighted expanders and the anisotropic Alon-Boppana theorem, Exploring the Tutte-Martin connection, Alternating knot diagrams, Euler circuits and the interlace polynomial, General structural results for Potts model partition functions on lattice strips, On generalized Ramsey theory: The bipartite case, Least-distortion Euclidean embeddings of graphs: Products of cycles and expanders, Evaluations of the circuit partition polynomial, Perfect Clar structures and 3-homogeneous simplicial complexes, Neighbourhood graphs of Cayley graphs for finitely-generated groups, Counting cycles and finite dimensional \(L^{p}\) norms, The number of 2-SAT functions, Hermitian matrices and graphs: Singular values and discrepancy, Minimal congestion trees, The facets and the symmetries of the approval-voting polytope, Large generalized books are \(p\)-good, Multicolour Turán problems, The rapid mixing of random walks defined by an \(n\)-cube, The structure and number of global roundings of a graph, Two bijective proofs for the arborescent form of the Good-Lagrange formula and some applications to colored rooted trees and cacti, The replacements of signed graphs and Kauffman brackets of link families, Enumeration of algebras close to absolutely free algebras and binary trees, Graphical models for imprecise probabilities, Discretization of compact Riemannian manifolds applied to the spectrum of Laplacian, Introduction to nonlinear dynamics of electronic systems: tutorial, Conductance, Laplacian and mixing rate in discrete dynamical systems, Conductance and noncommutative dynamical systems, The smallest eigenvalue of \(K_{r}\)-free graphs, On the colored Tutte polynomial of a graph of bounded treewidth, Determinant of the distance matrix of a tree with matrix weights, Graph colourings and solutions of systems of equations over finite fields, \(C_{3}\) saturated graphs, Ramsey functions involving \(K_{m,n}\) with \(n\) large, Large planar subgraphs in dense graphs, Distance matrix and Laplacian of a tree with attached graphs, Normality of semigroups with some links to graph theory., Extremal connectivity for topological cliques in bipartite graphs, On the complexity of unfrozen problems, Loop-erased walks and total positivity, Entropy, independent sets and antichains: A new approach to Dedekind’s problem, Cycles and paths in graphs with large minimal degree, Hyperplane arrangement cohomology and monomials in the exterior algebra, K5‐free subgraphs of random graphs, Unnamed Item, Large deviations for sums of partly dependent random variables, Random MAX SAT, random MAX CUT, and their phase transitions, Hamiltonicity and forbidden subgraphs in 4‐connected graphs, Spanning triangulations in graphs, Slow mixing of Glauber dynamics for the hard‐core model on regular bipartite graphs, Unnamed Item, Book Ramsey numbers. I, Boundary of Hurwitz spaces and explicit patching, Exact Potts model partition functions on strips of the honeycomb lattice, Exact Potts model partition functions on wider arbitrary-length strips of the square lattice, Communication in the two-way listen-in vertex-disjoint paths mode, Conjugacy relation on Coxeter elements, The complexity of arc-colorings for directed hypergraphs, Zeros of Jones polynomials for families of knots and links, Acyclic orientations and the chromatic polynomial, Frozen development in graph coloring, Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs, Claw-free 3-connectedP11-free graphs are hamiltonian, Minimum path bases and relevant paths
