scientific article; zbMATH DE number 3637904

zbMath0411.05032MaRDI QIDQ4198785

Publication date: 1979

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

matching extremal graphs random graphs Ramsey theory connectivity flows chromatic numbers coloring electrical networks graphs and groups four colour problem

Mathematics Subject Classification ID

Applications of design theory to circuits and networks (94C30) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)

Related Items

Vertices of given degree in a random graph, A fast algorithm for the construction of universal footprinting templates in DNA, Network formation and stable equilibrium, Edge‐cutsets in the directed hypercube, Optimal per-edge processing times in the semi-streaming model, Improved parallel depth-first search in undirected planar graphs, Unnamed Item, Asymptotic distributions in random graphs with applications to social networks, Graphical Models and Message-Passing Algorithms: Some Introductory Lectures, Unnamed Item, The triple zero graph of a commutative ring, Computable paradoxical decompositions, Vertex magic total labeling of middle and total graph of cycle, An upper bound for the total chromatic number of dense graphs, The n-zero-divisor graph of a commutative semigroup, Tree embeddings, The maximal flow from a compact convex subset to infinity in first passage percolation on $\mathbb{Z}^d $, Size of a minimal cutset in supercritical first passage percolation, Unnamed Item, Wiener Index on Lines of Unit Cells of the Body-Centered Cubic Grid, Constrained independence system and triangulations of planar point sets, Graph of Linear Transformations Over $$\mathbb {R}$$, Vertices with the second neighborhood property in Eulerian digraphs, The intersection subgroup graph of a group, Near-optimal distributed edge coloring, Graphical Enumeration and Stained Glass Windows, 1: Rectangular Grids, The replicator equation in stochastic spatial evolutionary games, Graph theory approach to exceptional points in wave scattering, Sets with structure, mappings and fixed point property: fixed point structures, Techniques for analyzing dynamic random graph models of web-like networks: An overview, A note on robustness of D-optimal block designs for two-colour microarray experiments, Multiplicités des valeurs propres et transformations étoile-triangle des graphes, Quantum walks induced by Dirichlet random walks on infinite trees, Counting spanning trees using modular decomposition, Unnamed Item, On Sparse Discretization for Graphical Games, Techniques of computable set theory with applications to proof verification, Maximal stream and minimal cutset for first passage percolation through a domain of $\mathbb{R}^{d}$, Access cost for asynchronous Byzantine quorum systems, The Zero-Divisor Graph of a Commutative Semigroup: A Survey, Total graph of a commutative semiring with respect to singular ideal, The decomposition of $K_v$ into $K_2\times K_5$'s, Steiner diagrams and $k$-star hubs, Non-permutability graph of subgroups, Frame graph, Unnamed Item, Existence and continuity of the flow constant in first passage percolation, On enumerating minimal dicuts and strongly connected subgraphs, L ^p -distortion and p -spectral gap of finite graphs, Graphs with given group and given constant link, Synchronization in random networks with given expected degree sequences, Kazhdan-Lusztig polynomials for 321-hexagon-avoiding permutations, On the insufficiency of linear diagrams for syllogisms, First-passage percolation, network flows and electrical resistances, Independent sets in triangle-free cubic planar graphs, Existence of the anchored isoperimetric profile in supercritical bond percolation in dimension two and higher, Cobham’s theorem and its extensions, Unnamed Item, Scheduling with forbidden sets, Domains and stochastic processes, Infinitary logic for computer science, Unnamed Item, Ramsey numbers of partial order graphs (comparability graphs) and implications in ring theory, Unnamed Item, TENSOR PRODUCT OF THE POWER GRAPHS OF SOME FINITE RINGS, Precise asymptotics of some meeting times arising from the voter model on large random regular graphs, Coalescence times andF_STvalues in subdivided populations with symmetric structure, Laplace eigenvalues and bandwidth‐type invariants of graphs, Higher-order Discretization Methods of Forward-backward SDEs Using KLNV-scheme and Their Applications to XVA Pricing, Conditional connectivity, Negative association in uniform forests and connected graphs, The linear $(n - 1)$-arboricity of some lexicographic product graphs, Kuratowski's theorem, A review of random graphs, Graphs, friends and acquaintances, The probabilistic approach to limited packings in graphs, On finite rings in which zero-divisor graphs satisfy the Dirac's condition., Discrete dynamical systems on graphs and Boolean functions, One-way cellular automata on Cayley graphs, The anti-adjacency matrix of a graph: eccentricity matrix, Cayley, Marty and Schreier hypergraphs, Hyperedge channels are abelian, Reconstruction methods for networks: the case of economic and financial systems, Every tree contains a large induced subgraph with all degrees odd, Bisector energy and few distinct distances, The reversing number of a digraph, A new approach to solving three combinatorial enumeration problems on planar graphs, The binding number of a graph and its circuits, Stability of random matrix models, Edge search in hypergraphs, Random walks and orthogonal functions associated with highly symmetric graphs, $K$-groups associated with substitution minimal systems, Note on induced subgraphs of the unit distance graph $E^ n$, Euler cycles in the complete graph $K_{2m+1}$, Hamiltonicity and colorings of arrangement graphs, Extremal theory for convex matchings in convex geometric graphs, The asymptotic number of labeled graphs with $n$ vertices, $q$ edges, and no isolated vertices, Compensations in small divisor problems, The existence of $(K_2\times K_6)$-designs, The complexity of the evaluation of complex algebra expressions, Generalized handles in graphs and connected sums of manifolds, On the minimum number of logical clauses inferred from examples, An NC algorithm for Brooks' theorem, Matrix scaling for large-scale system decomposition, Stable matchings and linear programming, On the linear $(n - 1)$-arboricity of $K_{n(m)}$, On the diameter and girth of a zero-divisor graph, Spectral distributions of adjacency and Laplacian matrices of random graphs, The generalized total graph of a commutative semiring, The permutation-path coloring problem on trees., A Nim game played on graphs., The existence of $(2 \times c, \lambda )$ grid-block designs with ${c\in \{3, 4, 5\}}$ and $\lambda \geq 1$, An algorithm for generating all maximal independent subsets of posets, Hadwiger's conjecture is true for almost every graph, Sorting in one round, Remarks on the computation of the horizon of a digital terrain, Positive equilibria of a class of power-law kinetics, On the ABC index of connected graphs with given degree sequences, Bisimulation for probabilistic transition systems: A coalgebraic approach, A variable neighborhood MOEA/D for multiobjective test task scheduling problem, Finding 2-edge connected spanning subgraphs., Characterization of consistent completion of reciprocal comparison matrices, The embedding of partial triple systems when 4 divides $\lambda$, Graphs without large triangle free subgraphs, Upper large deviations for the maximal flow through a domain of $\mathbb R^{d}$ in first passage percolation, On the tightness of the $\frac {5}{14}$ independence ratio, Cycles and spanning trees, Size and connectivity of the $k$-core of a random graph, Jacobian tori associated with a finite graph and its abelian covering graphs, Extended Petersen networks, The pebbling threshold of the square of cliques, Infinitary logics and 0-1 laws, Planar unit-distance graphs having planar unit-distance complement, Symmetric pants decompositions of Riemann surfaces, Optimal parallel algorithms for finding cut vertices and bridges of interval graphs, The total chromatic number of graphs having large maximum degree, A new view of relationship between atomic posets and complete (algebraic) lattices, The total graph of a commutative ring, On the small maximal flows in first passage percolation, Finite rings with complete bipartite zero-divisor graphs., A common extension of the Erdős-Stone theorem and the Alon-Yuster theorem for unbounded graphs, Matrix method for linear sequential dynamical systems on digraphs, Lower large deviations for the maximal flow through a domain of ${\mathbb{R}^d}$ in first passage percolation, Qualitative stability of linear systems, Pair formation of hard core bosons in flat band systems, Critical groups for homeomorphism classes of graphs, Edge search in graphs and hypergraphs of bounded rank, Growth profile and invariant measures for the weakly supercritical contact process on a homogeneous tree, On the n-cutset property, Isometric embedding in $\ell_ p$-spaces, Tilings and discrete Dirichlet problems, Triangulations intersect nicely, On the spectra of certain graphs arising from finite fields, Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT, On the parallel dynamics of the $Q$-state Potts and $Q$-Ising neural networks, The computational difficulty of manipulating an election, The combinatorics of effective resistances and resistive inverses, Planar quorums, Counting bridgeless graphs, A threshold for perfect matchings in random d-pure hypergraphs, The oriented cycle game, Almost all regular graphs are Hamiltonian, Characterization of pure strategy equilibria infinite anonymous games, Proof of a conjecture of Bollobás and Kohayakawa on the Erdős-Stone theorem, The zero-divisor graph of a commutative ring, Codimension-one foliations and oriented graphs, Critical probabilities for site and bond percolation models, Clique graphs of time graphs, On the problem of finding small subdivision and homomorphism bases for classes of countable graphs, Schubert graphs, symmetric groups and flags of Boolean lattices, The automorphism group of a structural matrix algebra, Almost-spanning subgraphs with bounded degree in dense graphs, Construction techniques for some thin sets in duals of compact abelian groups, Recent developments in total colouring, Pregeometric concepts on graphs and cellular networks as possible models of space-time at the Planck-scale, The connectivity of a graph on uniform points on [0,\,1$^{d}$.]