scientific article; zbMATH DE number 2229025
From MaRDI portal
Publication:5704408
zbMath1082.05001MaRDI QIDQ5704408
Jonathan L. Gross, Jay E. Yellen
Publication date: 15 November 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)
Related Items (77)
Edge version of SDD and ISI index for rooted product graphs ⋮ A topological classification of convex bodies ⋮ Mutation on knots and Whitney's 2-isomorphism theorem ⋮ CHY-graphs on a torus ⋮ Breaking the Curse of Dimension in Multi-Marginal Kantorovich Optimal Transport on Finite State Spaces ⋮ Computation of contour integrals on \( \mathcal{M}_{0,n} \) ⋮ \(\Lambda\) scattering equations ⋮ Known Algorithms for Edge Clique Cover are Probably Optimal ⋮ Unnamed Item ⋮ Coloring Sums of Extensions of Certain Graphs ⋮ Reliability of maximum spanning tree identification in correlation-based market networks ⋮ Unnamed Item ⋮ Adaptive formation control of networked Lagrangian systems with a moving leader ⋮ An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants ⋮ Facial unique-maximum edge and total coloring of plane graphs ⋮ GA topology optimization using random keys for tree encoding of structures ⋮ Modified linear programming and class 0 bounds for graph pebbling ⋮ Clique Cover and Graph Separation ⋮ The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach ⋮ Finite prime distance graphs and 2-odd graphs ⋮ Recognizing nullhomotopic maps into the classifying space of a Kac-Moody group ⋮ Analysis of divide-and-conquer strategies for the \(0-1\) minimization knapsack problem ⋮ The maximum number of triangles in a graph and its relation to the size of the Schur multiplier of special p-groups ⋮ Two‐phase strategies for the bi‐objective minimum spanning tree problem ⋮ Extending compositional data analysis from a graph signal processing perspective ⋮ On the selection of an optimal outer approximation of a coherent lower probability ⋮ Variable elimination in post-translational modification reaction networks with mass-action kinetics ⋮ Navigational guidance -- a deep learning approach ⋮ CONNECTED COMMON NEIGHBORHOOD SYSTEMS OF CLIQUES IN A GRAPH: A POLYNOMIAL REPRESENTATION ⋮ INDUCED CYCLE POLYNOMIAL OF A GRAPH ⋮ CONNECTED TOTAL DOMINATING NEIGHBORHOOD POLYNOMIAL OF GRAPHS ⋮ CHY loop integrands from holomorphic forms ⋮ An Introduction to Coding Sequences of Graphs ⋮ APPLICATION OF HOSOYA POLYNOMIAL TO SOLVE A CLASS OF TIME-FRACTIONAL DIFFUSION EQUATIONS ⋮ CONVEX INDEPENDENT COMMON NEIGHBORHOOD POLYNOMIAL OF A GRAPH ⋮ COMBINATORIAL APPROACH FOR COUNTING GEODETIC SETS WITH SUBDOMINATING NEIGHBORHOOD SYSTEMS ⋮ RATIONAL WEIGHT OF A GRAPH ⋮ CONNECTED DOMINATING INDEPENDENT NEIGHBORHOOD POLYNOMIAL OF GRAPHS ⋮ STAR POLYNOMIAL OF THE CORONA OF GRAPHS ⋮ INDUCED PATH POLYNOMIAL OF GRAPHS ⋮ A tree-based model for setting optimal train fare zones ⋮ Composite centrality: a natural scale for complex evolving networks ⋮ Examples of 4D, 𝒩 = 2 holoraumy ⋮ Graph theoretic foundations of multibody dynamics. I: Structural properties ⋮ The design and implementation of an interactive course-timetabling system ⋮ A Topologically Complete Theory of Weaving ⋮ On partitioning the edge set of a graph into internally disjoint paths without exterior vertices ⋮ Connecting Coined Quantum Walks with Szegedy's Model ⋮ Adinkras from ordered quartets of BC4 Coxeter group elements and regarding another Gadget’s 1,358,954,496 matrix elements ⋮ A genealogy of convex solids via local and global bifurcations of gradient vector fields ⋮ On the metric dimension of barycentric subdivision of Cayley graphs ⋮ Resolvability in subdivision of circulant networks \(C_n[1, k\)] ⋮ Measuring instance difficulty for combinatorial optimization problems ⋮ Unnamed Item ⋮ On the small cycle transversal of planar graphs ⋮ An Algorithm for Qualitative Simulation of Gene Regulatory Networks with Steep Sigmoidal Response Functions ⋮ A linear time algorithm for finding an optimal degree-bounded subtree of an edge-weighted tree ⋮ Ruleset optimization on isomorphic oritatami systems ⋮ Edge importance in a network via line graphs and the matrix exponential ⋮ Generalized fractional total colorings of graphs ⋮ HyPAM: A hybrid continuum-particle model for incompressible free-surface flows ⋮ Paired threshold graphs ⋮ Generalised colouring sums of graphs ⋮ Hilbert function and facet ideals of products of simplicial complexes ⋮ On Vertices and Facets of Combinatorial 2-Level Polytopes ⋮ Geodesic nets with three boundary vertices ⋮ Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders ⋮ The Herzog–Schönheim conjecture for finitely generated groups ⋮ \(k\)-Wiener index of a \(k\)-plex ⋮ Unnamed Item ⋮ Lower bounds in minimum rank problems ⋮ Unnamed Item ⋮ Dynamics on binary relations over topological spaces ⋮ On the maxima of Motzkin-Straus programs and cliques of graphs ⋮ An iterative algorithm for the management of an electric car-rental service ⋮ Linear complexity of sequences on Koblitz curves of genus 2 ⋮ Maximum total irregularity index of some families of graph with maximum degree n − 1
This page was built for publication:
