The following pages link to Handbook of Graph Theory (Q2868671):
Displaying 38 items.
- Pebbling in 2-paths (Q324757) (← links)
- On vertex independence number of uniform hypergraphs (Q399512) (← links)
- Pebbling in semi-2-trees (Q526223) (← links)
- Low-derivative operators of the standard model effective field theory via Hilbert series methods (Q1638279) (← links)
- Hamiltonian and pancyclic graphs in the class of self-centered graphs with radius two (Q1649905) (← links)
- It's all a matter of degree. Using degree information to optimize multiway joins (Q1650915) (← links)
- A characterization for 2-self-centered graphs (Q1692622) (← links)
- On zero-error codes produced by greedy algorithms (Q2084654) (← links)
- Safety in \(s\)-\(t\) paths, trails and walks (Q2118205) (← links)
- Which graphs occur as \(\gamma\)-graphs? (Q2191276) (← links)
- Reconstruction of score sets (Q2254545) (← links)
- Recognition of split-graphic sequences (Q2254547) (← links)
- Distinguishing graphs of maximum valence 3 (Q2278113) (← links)
- Toeplitz-composition \(\mathrm{C}^\ast\)-algebras induced by linear-fractional non-automorphism self-maps of the disk (Q2284358) (← links)
- Simplified target assignment problem for group engagement of aircraft (Q2290387) (← links)
- On \(H\)-supermagic labelings of \(m\)-shadow of paths and cycles (Q2330294) (← links)
- Tripartite graphs with given degree set (Q2516853) (← links)
- Genus, thickness and crossing number of graphs encoding the generating properties of finite groups (Q2659203) (← links)
- Super \(H\)-antimagic total covering for generalized antiprism and toroidal octagonal map (Q2666458) (← links)
- Pebbling in powers of paths (Q2689489) (← links)
- On min–max distance degree index (Q4597957) (← links)
- Isomorphisms of maps on the sphere (Q4998745) (← links)
- The local partition dimension of graphs (Q5013475) (← links)
- The soft graphic integer sub-decomposition method for elliptic scalar multiplication (Q5035834) (← links)
- The elliptic scalar multiplication graph and its application in elliptic curve cryptography (Q5035840) (← links)
- An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength (Q5084683) (← links)
- (Q5109886) (← links)
- (Q5111278) (← links)
- Characterisation and classification of signatures of spanning trees of the $n$-cube (Q5206928) (← links)
- Resolving domination number of graphs (Q5207505) (← links)
- Graph limits of random graphs from a subset of connected <i>k</i>‐trees (Q5236927) (← links)
- A novel graph-operational matrix method for solving multidelay fractional differential equations with variable coefficients and a numerical comparative survey of fractional derivative types (Q5742942) (← links)
- Graph complement conjecture for classes of shadow graphs (Q5862842) (← links)
- Local irregular vertex coloring of some families graph (Q5865650) (← links)
- Outliers in spectrum of sparse Wigner matrices (Q6050001) (← links)
- The 2CNF Boolean formula satisfiability problem and the linear space hypothesis (Q6098146) (← links)
- Independent 2-point set domination in graphs - II (Q6101464) (← links)
- A STUDY ON EQUITABLE CHROMATIC AND THRESHOLD OF MYCIELSKIAN OF GRAPHS (Q6115138) (← links)