Handbook of Graph Theory
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- On k-prime graphs
- On Hamilton cycle decompositions of r-uniform r-partite hypergraphs
- Integrality of Gopakumar-Vafa invariants of toric Calabi-Yau threefolds
- Distributed delay-tolerant strategies for equality-constraint sum-preserving resource allocation
- Pole structure of topological string free energy
- Positive zero forcing and edge clique coverings
- On unretractive graphs
- Variational integrators for electric circuits
- On minimal Sturmian partial words
- Subclass graph embedding and a marginal Fisher analysis paradigm
- Extending the doubly linked face list for the representation of 2-pseudomanifolds and 2-manifolds with boundaries
- Handbook of graph theory
- On existence of reporter strands in DNA-based graph structures
- On optimal completion of incomplete pairwise comparison matrices
- On the zero-divisor graphs of finite free semilattices
- All normalized anti-monotonic overlap graph measures are bounded
- Isomorphism-free lexicographic enumeration of triangulated surfaces and 3-manifolds
- On graphs associated to sets of rankings
- Adjacency preservers on invertible Hermitian matrices. I.
- Some properties on the tensor product of graphs obtained by monogenic semigroups
- The graph based on Gröbner-Shirshov bases of groups
- Graph classes and the switch Markov chain for matchings
- Semi square stable graphs and efficient dominating sets
- A new bound of radius with irregularity index
- Counting minimal semi-Sturmian words
- Sharp lower and upper bounds for the Gaussian rank of a graph
- Graphs associated with vector spaces of even dimension: A link with differential geometry
- Protean graphs with a variety of ranking schemes
- Counter machines and crystallographic structures
- The achromatic colouring of graphs
- Median eigenvalues of bipartite graphs
- A Python hands-on tutorial on network and topological neuroscience
- An algebraic theory of nondeterministic finite automata
- Quantum algorithm for lexicographically minimal string rotation
- Investigating the \(b\)-chromatic number of bipartite graphs by using the bicomplement
- Bounds on the spectral radius of digraphs from subgraph counts
- Drawing Big Graphs Using Spectral Sparsification
- Characterization of perfect matching transitive graphs
- Crack STIT tessellations: characterization of stationary random tessellations stable with respect to iteration
- The minimum semidefinite rank of a triangle-free graph
- Voting procedures, complexity of
- Restricted arc-connectivity of generalized \(p\)-cycles
- Oriented chromatic number of grids is greater than 7
- Graph classes and the complexity of the graph orientation minimizing the maximum weighted outdegree
- Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
- Target control and expandable target control of complex networks
- On spanning cycles, paths and trees
- (r,r+1)-factorizations of (d,d+1)-graphs
- Heuristics for deciding collectively rational consumption behavior
- Bosonization based on Clifford algebras and its gauge theoretic interpretation
- Time discretizations of Wasserstein-Hamiltonian flows
- Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \)
- On achromatic number of central graph of some graphs
- A textbook of graph theory
- Graph orientation to maximize the minimum weighted outdegree
- An efficient and robust design optimisation of multi-state flow network for multiple commodities using generalised reliability evaluation algorithm and edge reduction method
- Time constrained graph searching
- A lower bound for the vertex boundary-width of complete \(k\)-ary trees
- Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface
- The inclusion prime ideal graph of a semigroup and ring
- On the runtime and robustness of randomized broadcasting
- On some properties of the Laplacian matrix revealed by the RCM algorithm.
- Old and new results on algebraic connectivity of graphs
- Equitable distinguishing chromatic number
- Line graphs of monogenic semigroup graphs
- Some indices over a new algebraic graph
- The sigma coindex of graph operations
- Degree-bounded factorizations of bipartite multigraphs and of pseudographs
- Spectral properties of the permutability graph of subgroups
- Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs
- Toward model-based control of non-linear hydraulic networks
- Analysis of some topological indices over the weakly zero-divisor graph of the ring \(\mathbb{Z}_p \times \mathbb{Z}_q \times \mathbb{Z}_r\)
- Clear graph of a ring
- A supernodal formulation of vertex colouring with applications in course timetabling
- Perfect matching and Hamilton cycle decomposition of complete balanced \(( k + 1 )\)-partite \(k\)-uniform hypergraphs
- Some properties of zero divisor graph obtained by the ring \(Z_p \times Z_q \times Z_r\)
- Some properties on the disjunctive product over graphs of monogenic semigroups
- On the corona product of monogenic semigroup graphs
- Compressed cliques graphs, clique coverings and positive zero forcing
- Line graph of annihilating-ideal graph of commutative rings
- Geometric modal logic
- Zero-divisor super-\(\lambda\) graphs
- PROPERTIES OF ZERO-DIVISOR GRAPH OF THE RING $\mathbf{F}_{p^l} \times \mathbf{F}_{q^m} \times \mathbf{F}_{r^n}$
- scientific article; zbMATH DE number 7583269 (Why is no real title available?)
- On identifying vertices of tournament digraphs
- A branch-and-bound algorithm for the acyclic partitioning problem
- SOME GRAPH PARAMETERS OF POWER SET GRAPHS
- Efficient edge domination in regular graphs
- Finding similar/diverse solutions in answer set programming
- The mincut graph of a graph
- Analytical relationships between metric and centrality measures of a network and its dual
- Selective hypergraph colourings
- Some family of distance pattern distinguishing graphs and realization results
- scientific article; zbMATH DE number 7308162 (Why is no real title available?)
- Toward a classification of isodynamic feed-forward motifs
- On the dot product of graphs over monogenic semigroups
- On the X-rays of permutations
- REWRITING LOGIC-BASED SEMANTICS OF P SYSTEMS AND THE MAXIMAL CONCURRENCY
- Distributed allocation and resource scheduling algorithms resilient to link failure
- A continuous analog for 4-dimensional objects
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)
