Handbook of graph theory
From MaRDI portal
Recommendations
Cited in
(54)- Low-derivative operators of the standard model effective field theory via Hilbert series methods
- Hamiltonian and pancyclic graphs in the class of self-centered graphs with radius two
- It's all a matter of degree. Using degree information to optimize multiway joins
- Graph theory. Favorite conjectures and open problems -- 2
- A characterization for 2-self-centered graphs
- On zero-error codes produced by greedy algorithms
- Safety in s-t paths, trails and walks
- Which graphs occur as \(\gamma\)-graphs?
- Reconstruction of score sets
- Recognition of split-graphic sequences
- Distinguishing graphs of maximum valence 3
- Toeplitz-composition \(C^\ast\)-algebras induced by linear-fractional non-automorphism self-maps of the disk
- Simplified target assignment problem for group engagement of aircraft
- On \(H\)-supermagic labelings of \(m\)-shadow of paths and cycles
- Tripartite graphs with given degree set
- Genus, thickness and crossing number of graphs encoding the generating properties of finite groups
- Super \(H\)-antimagic total covering for generalized antiprism and toroidal octagonal map
- Pebbling in powers of paths
- Pebbling in 2-paths
- scientific article; zbMATH DE number 5601298 (Why is no real title available?)
- On vertex independence number of uniform hypergraphs
- Handbook of Graph Theory
- scientific article; zbMATH DE number 1518742 (Why is no real title available?)
- On min-max distance degree index
- Isomorphisms of maps on the sphere
- The local partition dimension of graphs
- The soft graphic integer sub-decomposition method for elliptic scalar multiplication
- The elliptic scalar multiplication graph and its application in elliptic curve cryptography
- An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength
- Independent sets and vertex covers considered within the context of robust optimization
- scientific article; zbMATH DE number 7204396 (Why is no real title available?)
- Characterisation and classification of signatures of spanning trees of the \(n\)-cube
- Resolving domination number of graphs
- Graph limits of random graphs from a subset of connected k-trees
- Pebbling in semi-2-trees
- A novel graph-operational matrix method for solving multidelay fractional differential equations with variable coefficients and a numerical comparative survey of fractional derivative types
- Graph complement conjecture for classes of shadow graphs
- Local irregular vertex coloring of some families graph
- A textbook of graph theory
- Outliers in spectrum of sparse Wigner matrices
- The 2CNF Boolean formula satisfiability problem and the linear space hypothesis
- Independent 2-point set domination in graphs - II
- A STUDY ON EQUITABLE CHROMATIC AND THRESHOLD OF MYCIELSKIAN OF GRAPHS
- Generalized Cayley maps and their Petrie duals
- Solving the minimum-cost double Roman domination problem
- On the secure vertex cover pebbling number
- \textit{On certainty}, change, and ``mathematical hinges
- Some results on non-comaximal ideal graph of a ring
- Measure-based approach to mesoscopic modeling of optimal transportation networks
- A folding preprocess for the max k-cut problem
- The minimum orientable genus of the repeated Cartesian product of graphs
- A general design method for scaffold-free DNA wireframe nanostructures
- On the K-theory of the AF core of a graph C*-algebra
- On total distance irregular labeling of families graph and corona product of graphs
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 Q2868671)
