The following pages link to Theory and Applications of Graphs (Q3380398):
Displayed 50 items.
- Conditional Strong Matching Preclusion of the Alternating Group Graph (Q5213544) (← links)
- Rearrangement operations on unrooted phylogenetic networks (Q5213545) (← links)
- Graham's Pebbling Conjecture Holds for the Product of a Graph and a Sufficiently Large Complete Graph (Q5213546) (← links)
- Hamiltonicity and $\sigma$-hypergraphs (Q5225505) (← links)
- Note on rainbow connection in oriented graphs with diameter 2 (Q5225507) (← links)
- An Isomorphism Problem in Z^2 (Q5225508) (← links)
- Second Hamiltonian cycles in claw-free graphs (Q5225510) (← links)
- Bounds for the Zero Forcing Number of Graphs with Large Girth (Q5225511) (← links)
- Dynamic approach to k-forcing (Q5225512) (← links)
- Scheduling N Burgers for a k-Burger Grill: Chromatic Numbers With Restrictions (Q5225513) (← links)
- Path-tables of trees: a survey and some new results (Q5225514) (← links)
- Connection and separation in hypergraphs (Q5225516) (← links)
- An edge-swap heuristic for finding dense spanning trees (Q5225517) (← links)
- An Extremal Problem for Finite Lattices (Q5225518) (← links)
- Eternal Independent Sets in Graphs (Q5225519) (← links)
- A Class of Graphs Approaching Vizing's Conjecture (Q5225521) (← links)
- Path-factors involving paths of order seven and nine (Q5225522) (← links)
- Group-antimagic Labelings of Multi-cyclic Graphs (Q5225523) (← links)
- Classifying Resolving Lists by Distances between Members (Q5225524) (← links)
- On the Graceful Cartesian Product of Alpha-Trees (Q5225531) (← links)
- Two short proofs of the Perfect Forest Theorem (Q5225532) (← links)
- Note On 6-regular Graphs On The Klein Bottle (Q5225534) (← links)
- Application of an Extremal Result of Erdős and Gallai to the (n,k,t) Problem (Q5225535) (← links)
- Edge Colorings of Complete Multipartite Graphs Forbidding Rainbow Cycles (Q5225536) (← links)
- Generalized Matching Preclusion in Bipartite Graphs (Q5225539) (← links)
- Traveling in Networks with Blinking Nodes (Q5225540) (← links)
- Policy-Preferred Paths in AS-level Internet Topology Graphs (Q5225542) (← links)
- A General Lower Bound on Gallai-Ramsey Numbers for Non-Bipartite Graphs (Q5225543) (← links)
- $\gamma'$-Realizability and Other Musings on Inverse Domination (Q5225545) (← links)
- Finite Asymptomatic Clusters of Metric Spaces (Q5225546) (← links)
- An Efficient Algorithm to Test Forcibly-connectedness of Graphical Degree Sequences (Q5225547) (← links)
- Integer-antimagic spectra of disjoint unions of cycles (Q5225548) (← links)
- Minimal Graphs with a Specified Code Map Image (Q5225549) (← links)
- Reducing the maximum degree of a graph by deleting vertices: the extremal cases (Q5225550) (← links)
- Finite Simple Graphs and Their Associated Graph Lattices (Q5225552) (← links)
- Subsets of vertices of the same size and the same maximum distance (Q5225553) (← links)
- Singular Ramsey and Turán numbers (Q5225554) (← links)
- On the Planarity of Generalized Line Graphs (Q5225555) (← links)
- Fractional matching preclusion for butterfly derived networks (Q5225556) (← links)
- HS-integral and Eisenstein integral mixed circulant graphs (Q5869875) (← links)
- Counting Power Domination Sets in Complete m-ary Trees (Q5869879) (← links)
- Outer Independent Double Italian Domination of Some Graph Products (Q5884397) (← links)
- Optimal orientations of Vertex-multiplications of Trees with Diameter 4 (Q5884398) (← links)
- On Nowhere Zero 4-Flows in Regular Matroids (Q6068939) (← links)
- On the hardness of the Balanced Connected Subgraph Problem for families of Regular Graphs (Q6068941) (← links)
- Wiener index in graphs given girth, minimum, and maximum degrees (Q6068943) (← links)
- Toughness of Recursively Partitionable Graphs (Q6147455) (← links)
- The Ricci Curvature on Simplicial Complexes (Q6147456) (← links)
- Difference of Facial Achromatic Numbers between Two Triangular Embeddings of a Graph (Q6147457) (← links)
- Ramsey Numbers for Connected 2-Colorings of Complete Graphs (Q6174606) (← links)