Handbook of Graph Theory
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- Efficient edge domination in regular graphs
- On existence of reporter strands in DNA-based graph structures
- Protean graphs with a variety of ranking schemes
- Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds
- Subclass graph embedding and a marginal Fisher analysis paradigm
- Computing generalized de Bruijn sequences
- Capacitated arc routing problem with deadheading demands
- Periods in partial words: an algorithm
- Measurable chromatic and independence numbers for ergodic graphs and group actions
- Counter machines and crystallographic structures
- Some indices over a new algebraic graph
- Line graphs of monogenic semigroup graphs
- The sigma coindex of graph operations
- A Python hands-on tutorial on network and topological neuroscience
- Equitable distinguishing chromatic number
- Target control and expandable target control of complex networks
- Median eigenvalues of bipartite graphs
- Sharp lower and upper bounds for the Gaussian rank of a graph
- New bounds and extended relations between prefix arrays, border arrays, undirected graphs, and indeterminate strings
- On the dot product of graphs over monogenic semigroups
- A lower bound for the vertex boundary-width of complete \(k\)-ary trees
- Investigating the \(b\)-chromatic number of bipartite graphs by using the bicomplement
- The graph based on Gröbner-Shirshov bases of groups
- On spanning cycles, paths and trees
- Counting minimal semi-Sturmian words
- (r,r+1)-factorizations of (d,d+1)-graphs
- Integrality of Gopakumar-Vafa invariants of toric Calabi-Yau threefolds
- Pole structure of topological string free energy
- Nonnegatively curved 5-manifolds with almost maximal symmetry rank
- Graphs as navigational infrastructure for high dimensional data spaces
- [[:Publication:2513377|Eulerian tour algorithms for data visualization and the \(Template:\mathtt PairViz\) package]]
- Compressed cliques graphs, clique coverings and positive zero forcing
- Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphs
- Bosonization based on Clifford algebras and its gauge theoretic interpretation
- Adjacency preservers on invertible Hermitian matrices. I.
- A Markov chain on the solution space of edge colorings of bipartite graphs
- Some properties on the tensor product of graphs obtained by monogenic semigroups
- An efficient and robust design optimisation of multi-state flow network for multiple commodities using generalised reliability evaluation algorithm and edge reduction method
- Certain chromatic sums of some cycle-related graph classes
- Toward a classification of isodynamic feed-forward motifs
- On some properties of the Laplacian matrix revealed by the RCM algorithm.
- On harmonious colouring of \(C(W_n)\) and \(C(F_{m,n})\)
- Generalization of achromatic colouring of central graphs
- The achromatic colouring of graphs
- Handbook of graph theory
- Extending the doubly linked face list for the representation of 2-pseudomanifolds and 2-manifolds with boundaries
- The number of shortest paths in the (n, k)-star graph
- Toward model-based control of non-linear hydraulic networks
- Graph orientation to maximize the minimum weighted outdegree
- Nontestability of equal weights spatial dependence
- A branch-and-bound algorithm for the acyclic partitioning problem
- From rankings’ collinearity to counting SDR's via chromatic list expression
- Perfect matching dominating cycle — a new dominating cycle
- On the X-rays of permutations
- Observing the state of a smart grid using bilevel programming
- A continuous analog for 4-dimensional objects
- REWRITING LOGIC-BASED SEMANTICS OF P SYSTEMS AND THE MAXIMAL CONCURRENCY
- Graph operations and neighbor rupture degree
- A new bound of radius with irregularity index
- On Hamilton cycle decompositions of r-uniform r-partite hypergraphs
- Variational integrators for electric circuits
- All normalized anti-monotonic overlap graph measures are bounded
- Oriented chromatic number of grids is greater than 7
- Graphs associated with vector spaces of even dimension: A link with differential geometry
- Restricted arc-connectivity of generalized \(p\)-cycles
- Drawing Big Graphs Using Spectral Sparsification
- Positive zero forcing and edge clique coverings
- On the zero-divisor graphs of finite free semilattices
- Basic concepts in graph theory and algorithms
- Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
- On graphs associated to sets of rankings
- Some properties on the disjunctive product over graphs of monogenic semigroups
- On the corona product of monogenic semigroup graphs
- Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
- Characterization of perfect matching transitive graphs
- Perfect matching and Hamilton tight cycle decomposition of complete n-balanced r-partite k-uniform hypergraphs
- Some family of distance pattern distinguishing graphs and realization results
- Semi square stable graphs and efficient dominating sets
- Perfect matching transitivity of circulant graphs
- Time discretizations of Wasserstein-Hamiltonian flows
- SOME GRAPH PARAMETERS OF POWER SET GRAPHS
- On achromatic number of central graph of some graphs
- scientific article; zbMATH DE number 7583269 (Why is no real title available?)
- Bounds on the spectral radius of digraphs from subgraph counts
- Genus of a graph and its strong preservers
- scientific article; zbMATH DE number 7308162 (Why is no real title available?)
- Voting procedures, complexity of
- Rigorous continuum limit for the discrete network formation problem
- Some properties of zero divisor graph obtained by the ring \(Z_p \times Z_q \times Z_r\)
- Finding similar/diverse solutions in answer set programming
- On minimal Sturmian partial words
- Coordinated road-network search route planning by a team of UAVs
- Crack STIT tessellations: characterization of stationary random tessellations stable with respect to iteration
- Stability for coupled systems on networks with Caputo-Hadamard fractional derivative
- On unretractive graphs
- A textbook of graph theory
- Graph classes and the switch Markov chain for matchings
- Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface
- Relation-algebraic specification and solution of special university timetabling problems
- A supernodal formulation of vertex colouring with applications in course timetabling
This page was built for publication: Handbook of Graph Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4435150)
