Publication:5704408
From MaRDI portal
zbMath1082.05001MaRDI QIDQ5704408
Jonathan L. Gross, Jay E. Yellen
Publication date: 15 November 2005
05-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics
05Cxx: Graph theory
Related Items
Adinkras from ordered quartets of BC4 Coxeter group elements and regarding another Gadget’s 1,358,954,496 matrix elements, Generalised colouring sums of graphs, Unnamed Item, Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders, The Herzog–Schönheim conjecture for finitely generated groups, Coloring Sums of Extensions of Certain Graphs, Examples of 4D, 𝒩 = 2 holoraumy, Ruleset optimization on isomorphic oritatami systems, A topological classification of convex bodies, An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants, GA topology optimization using random keys for tree encoding of structures, Finite prime distance graphs and 2-odd graphs, The design and implementation of an interactive course-timetabling system, A genealogy of convex solids via local and global bifurcations of gradient vector fields, On the metric dimension of barycentric subdivision of Cayley graphs, On the small cycle transversal of planar graphs, Graph theoretic foundations of multibody dynamics. I: Structural properties, On partitioning the edge set of a graph into internally disjoint paths without exterior vertices, A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree, HyPAM: A hybrid continuum-particle model for incompressible free-surface flows, Lower bounds in minimum rank problems, CHY-graphs on a torus, Computation of contour integrals on \( \mathcal{M}_{0,n} \), \(\Lambda\) scattering equations, Adaptive formation control of networked Lagrangian systems with a moving leader, CHY loop integrands from holomorphic forms, A tree-based model for setting optimal train fare zones, Measuring instance difficulty for combinatorial optimization problems, Paired threshold graphs, The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach, Variable elimination in post-translational modification reaction networks with mass-action kinetics, Analysis of divide-and-conquer strategies for the \(0-1\) minimization knapsack problem, Edge importance in a network via line graphs and the matrix exponential, Dynamics on binary relations over topological spaces, An iterative algorithm for the management of an electric car-rental service, Mutation on knots and Whitney's 2-isomorphism theorem, Modified linear programming and class 0 bounds for graph pebbling, Composite centrality: a natural scale for complex evolving networks, Generalized fractional total colorings of graphs, Unnamed Item, On Vertices and Facets of Combinatorial 2-Level Polytopes, Clique Cover and Graph Separation, An Introduction to Coding Sequences of Graphs, Breaking the Curse of Dimension in Multi-Marginal Kantorovich Optimal Transport on Finite State Spaces, Known Algorithms for Edge Clique Cover are Probably Optimal, An Algorithm for Qualitative Simulation of Gene Regulatory Networks with Steep Sigmoidal Response Functions
