scientific article
From MaRDI portal
Publication:3508462
zbMath1170.05001MaRDI QIDQ3508462
Jeffry L. Hirst, John M. Harris, Michael J. Mossinghoff
Publication date: 1 July 2008
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Other combinatorial set theory (03E05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)
Related Items
Exploring Combinatorics and Graph Theory with Simple Blokus, On some sign patterns of algebraically positive matrices, On stability of discrete-time switched systems, The proof-theoretic strength of Ramsey's theorem for pairs and two colors, A graph theoretic approach to input-to-state stability of switched systems, On the hyperbolic Pascal pyramid, On polyhedral graphs and their complements, On optimization of stochastic max-min-plus-scaling systems -- an approximation approach, Intersecting longest paths, A node current-based 2-index formulation for the fixed-destination multi-depot travelling salesman problem, Nonempty intersection of longest paths in a graph with a small matching number, Some non-periodic \(p\)-adic generalized Gibbs measures for the Ising model on a Cayley tree of order \(k\), A distributed optimization approach via symmetric group actions under time-varying communication networks, Eccentricity based topological indices of an oxide network, On the double-critical graph conjecture, A new class of generalized Fubini polynomials and their computational algorithms, Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms, Set systems: order types, continuous nondeterministic deformations, and quasi-orders, Integral eigen-pair balanced classes of graphs with their ratio, asymptote, area, and involution-complementary aspects, A general scheme for log-determinant computation of matrices via stochastic polynomial approximation, Nonempty intersection of longest paths in graphs without forbidden pairs, A class of conceptual spaces consisting of boundaries of infinite \(p\)-ary trees, The robustness of resolvable block designs against the loss of whole blocks or replicates, Partitioned iterated function systems with division and a fractal dependence graph in recognition of 2D shapes, Minimal subfamilies and the probabilistic interpretation for modulus on graphs, Planarity of Cayley graphs of graph products of groups, A note on the convexity of \(\mathbf C\mapsto h(\det\mathbf C)\), The beta log-normal distribution, Enumerating isodiametric and isoperimetric polygons, Local search heuristics for the multidimensional assignment problem, Nonempty intersection of longest paths in series-parallel graphs, Unnamed Item, Pascal pyramid in the space $\mathbf{H}^2\!\times\!\mathbf{R}$, Power-law decay of weights and recurrence of the two-dimensional VRJP, On Functions Computed on Trees, Busy period analysis for the GI/M/1 queue with phase-type vacations, On the degree-based topological indices of the tickysim SpiNNAKER model, Rapid mixing of Swendsen–Wang dynamics in two dimensions, Unnamed Item, Fractional calculus and the ESR test, New algorithm for calculating chromatic index of graphs and its applications, The Erdős–Faber–Lovász conjecture for the class of δEFL graphs, Fluctuation estimates for sub-quadratic gradient field actions
