scientific article; zbMATH DE number 3637904
From MaRDI portal
Publication:4198785
zbMath0411.05032MaRDI QIDQ4198785
Publication date: 1979
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
matchingextremal graphsrandom graphsRamsey theoryconnectivityflowschromatic numberscoloringelectrical networksgraphs and groupsfour colour problem
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 (only showing first 100 items - show all)
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 andFSTvalues 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
This page was built for publication:
