scientific article; zbMATH DE number 854567
From MaRDI portal
Publication:4869540
zbMATH Open0845.05001MaRDI QIDQ4869540FDOQ4869540
Authors: Douglas B. West 
Publication date: 11 March 1996
Title of this publication is not available (Why is that?)
Recommendations
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)
Cited In (only showing first 100 items - show all)
- Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem
- Modelling and control of cholera on networks with a common water source
- Two-stage matching-and-scheduling algorithm for real-time private parking-sharing programs
- An algorithm for computing cutpoints in finite metric spaces
- Steiner tree problem with minimum number of Steiner points and bounded edge-length
- Extending the type reproduction number to infectious disease control targeting contacts between types
- On approximating tree spanners that are breadth first search trees
- On the ordered list subgraph embedding problems
- Sharp lower bounds on the Narumi-Katayama index of graph operations
- The number of Latin squares of order 11
- A NOTE ON THE COMMUTING GRAPHS OF A CONJUGACY CLASS IN SYMMETRIC GROUPS
- On the location of roots of independence polynomials
- On resistance of graphs
- Analysis of autonomous Lotka-Volterra competition systems with random perturbation
- Stochastically asymptotically stability of the multi-group SEIR and SIR models with random perturbation
- The total graph and regular graph of a commutative ring
- Endpoint extendable paths in dense graphs
- Dynamics of a multigroup SIR epidemic model with stochastic perturbation
- Approximations for Steiner trees with minimum number of Steiner points
- The bipartite edge frustration of hierarchical product of graphs
- Bounds on the coefficients of tension and flow polynomials
- Maximum number of fixed points in regulatory Boolean networks
- Orienting Cayley graphs generated by transposition trees
- Spanning trees: A survey
- Interval edge-colorings of \(K_{1, m, n}\)
- Interval Non‐edge‐Colorable Bipartite Graphs and Multigraphs
- The bipartite edge frustration of composite graphs
- Global stability analysis for stochastic coupled systems on networks
- Super \(d\)-antimagic labelings of disconnected plane graphs
- On the differences between Szeged and Wiener indices of graphs
- Distributed stopping for average consensus in undirected graphs via event-triggered strategies
- A cyclic solution for an infinite class of Hamilton-Waterloo problems
- Determining sets, resolving sets, and the exchange property
- Uniquely tree-saturated graphs
- On zero-sum partitions and anti-magic trees
- Global-stability problem for coupled systems of differential equations on networks
- Star coloring under some graph operations
- Motion tracking as a constrained optimization problem.
- Interval edge-colorings of complete graphs
- Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles
- I,F-partitions of sparse graphs
- A refined algorithm for maximum independent set in degree-4 graphs
- Vertex-distinguishing proper arc colorings of digraphs
- Domination game critical graphs
- Multicut in trees viewed through the eyes of vertex cover
- Interval edge-colorings of complete graphs and \(n\)-dimensional cubes
- The bipartite edge frustration of extension of splice and link graphs
- Normal matrices subordinate to a tree and flat portions of the field of values
- Qualitative behavior of a smoking model
- Stochastic stability for pantograph multi-group models with dispersal and stochastic perturbation
- A note on integral non-commuting graphs
- The Zagreb coindices of graph operations
- Problems and algorithms for covering arrays
- Graph-theoretic approach to stability of multi-group models with dispersal
- Spectral characterization of the Hamming graphs
- Laplacian graph eigenvectors
- Tree spanners of bounded degree graphs
- The label cut problem with respect to path length and label frequency
- Strong Allee effect in a stochastic logistic model with mate limitation and stochastic immigration
- Edge-disjoint spanning trees and eigenvalues of regular graphs
- Upper bounds on the \(k\)-forcing number of a graph
- Extremal sparsity of the companion matrix of a polynomial
- On graphs whose graphoidal domination number is one
- On the hereditary \((p,q)\)-Helly property of hypergraphs, cliques, and bicliques
- On \((k,d)\)-Skolem graceful graphs
- Global 2-point set domination number of a graph
- Domination in graphoidally covered graphs: least-kernel graphoidal covers
- Minimum \(k\)-path vertex cover
- Some inequalities for the atom-Bond connectivity index of graph operations
- The power of digraph products applied to labelings
- Algorithmic complexity of proper labeling problems
- Amalgamations of connected \(k\)-factorizations.
- Graphs whose Szeged and Wiener numbers differ by 4 and 5
- Metric or partial metric spaces endowed with a finite number of graphs: a tool to obtain fixed point results
- Packing coloring of Sierpiński-type graphs
- Multi-switch: A tool for finding potential edge-disjoint 1-factors
- Enumerating colorings, tensions and flows in cell complexes
- Computational Classification of Tubular Algebras
- Function simulation, graph grammars and colourings
- Parameterized complexity of vertex colouring
- Complexity of learning in concept lattices from positive and negative examples
- Computational study on planar dominating set problem
- Computing the bipartite edge frustration of fullerene graphs
- Synchronizing finite automata on Eulerian digraphs.
- Cluster algebras and Weil-Petersson forms
- Dot product representations of graphs
- Bounds on \(F\)-index of tricyclic graphs with fixed pendant vertices
- Square-free perfect graphs.
- Standard examples as subposets of posets.
- On the adjacency matrix of a threshold graph
- The parameterized complexity of some minimum label problems
- The complexity of the proper orientation number
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks. I: Sufficient conditions
- Matching preclusion and conditional matching preclusion for bipartite interconnection networks. II: Cayley graphs generated by transposition trees and hyper-stars
- Network information flow
- Labeling constructions using digraph products
- Linearly many faults in 2-tree-generated networks
- The existence of periodic solutions for coupled pantograph Rayleigh system
- Global stability analysis of discrete-time coupled systems on networks and its applications
- Edge-colouring of join graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4869540)
