The following pages link to Theory and Applications of Graphs (Q3380398):
Displayed 50 items.
- Reducing the maximum degree of a graph: comparisons of bounds (Q3380399) (← links)
- Classification of Cayley Rose Window Graphs (Q3380400) (← links)
- The Structure Of Functional Graphs For Functions From A Finite Domain To Itself For Which A Half Iterate Exists (Q3380401) (← links)
- The Color Number of Cubic Graphs Having a Spanning Tree with a Bounded Number of Leaves (Q3380402) (← links)
- On Graphs with Proper Connection Number 2 (Q3380403) (← links)
- On \delta^(k)-colouring of Powers of Paths and Cycles (Q3380405) (← links)
- Skolem Number of Cycles and Grid Graphs (Q3380406) (← links)
- Upper bounds for inverse domination in graphs (Q3380407) (← links)
- The Integer-antimagic Spectra of Graphs with a Chord (Q4987148) (← links)
- Nilpotent Graph (Q4987151) (← links)
- An Efficient Algorithm to Test Potential Bipartiteness of Graphical Degree Sequences (Q4987152) (← links)
- Characterization of outerplanar graphs with equal 2-domination and domination numbers (Q5044516) (← links)
- One-factorizations of the complete graph $K_{p+1}$ arising from parabolas (Q5044517) (← links)
- On p-competition graphs of loopless Hamiltonian digraphs without symmetric arcs and graph operations (Q5044518) (← links)
- Harmonious Labelings Via Cosets and Subcosets (Q5044522) (← links)
- On the Total Set Chromatic Number of Graphs (Q5044524) (← links)
- Geodesic bipancyclicity of the Cartesian product of graphs (Q5044525) (← links)
- Total Colouring of New Classes of Subcubic graphs (Q5044527) (← links)
- On the Integer-antimagic Spectra of Non-Hamiltonian Graphs (Q5044528) (← links)
- Restrained reinforcement number in graphs (Q5044530) (← links)
- Radio Number of Hamming Graphs of Diameter 3 (Q5044532) (← links)
- Alpha Labeling of Amalgamated Cycles (Q5044533) (← links)
- Fault diagnosability of regular graphs (Q5057208) (← links)
- An Even 2-Factor in the Line Graph of a Cubic Graph (Q5057209) (← links)
- Ultrametrics and Complete Multipartite Graphs (Q5057210) (← links)
- Rainbow Perfect and Near-Perfect Matchings in Complete Graphs with Edges Colored by Circular Distance (Q5057212) (← links)
- Path-Stick Solitaire on Graphs (Q5057213) (← links)
- On the uniqueness of continuation of a partially defined metric (Q5057214) (← links)
- On Rainbow Cycles and Proper Edge Colorings of Generalized Polygons (Q5057215) (← links)
- A Complete Characterisation of Vertex-multiplications of Trees with Diameter 5 (Q5071285) (← links)
- Chromatic Polynomials of Signed Book Graphs (Q5071286) (← links)
- Characterizing Edge Betweenness-Uniform graphs (Q5071287) (← links)
- Prime labelings on planar grid graphs (Q5071288) (← links)
- Triangles in Ks-saturated graphs with minimum degree t (Q5113451) (← links)
- Recursive Formulas for Beans Functions of Graphs (Q5113452) (← links)
- On a Vizing-type Integer Domination Conjecture (Q5113453) (← links)
- An Improvement in the Two-packing Bound Related to Vizing's Conjecture (Q5119802) (← links)
- Domination number of annulus triangulations (Q5119804) (← links)
- Radio Graceful Labelling of Graphs (Q5119805) (← links)
- The Burning Number of Directed Graphs: Bounds and Computational Complexity (Q5119806) (← links)
- Laplacian Spectral Properties of Signed Circular Caterpillars (Q5119807) (← links)
- Decomposition of Certain Complete Graphs and Complete Multipartite Graphs into Almost-bipartite Graphs and Bipartite Graphs (Q5119808) (← links)
- Isomorphism of Trees and Isometry of Ultrametric Spaces (Q5140921) (← links)
- Series-Parallel Operations with Alpha-Graphs (Q5205653) (← links)
- Matching Preclusion of the Generalized Petersen Graph (Q5205654) (← links)
- Maximum Oriented Forcing Number for Complete Graphs (Q5205655) (← links)
- Colored complete hypergraphs containing no rainbow Berge triangles (Q5205656) (← links)
- Fractional strong matching preclusion for two variants of hypercubes (Q5205657) (← links)
- Laplacian Spectral Characterization of Signed Sun Graphs (Q5205658) (← links)
- Forcibly-biconnected Graphical Degree Sequences: Decision Algorithms and Enumerative Results (Q5205659) (← links)