50 results on '"05c05"'
Search Results
2. Partial Domination of Hypergraphs
Catalog
Books, media, physical & digital resources
3. Ramsey Numbers of Multiple Copies of Graphs in a Component
4. The Burning Number Conjecture is True for Trees without Degree-2 Vertices
5. The Existence of a Path with Two Blocks in Digraphs
6. Edge-Disjoint Steiner Trees and Connectors in Graphs
7. The Ramsey Number for a Forest Versus Disjoint Union of Complete Graphs
8. 2-(Edge-)Connected Edge Domination Number and Matching Number
9. Quaternionic 1-Factorizations and Complete Sets of Rainbow Spanning Trees
10. A Conjecture on Different Central Parts of Binary Trees
11. Degree Conditions for Completely Independent Spanning Trees of Bipartite Graphs
12. Total eccentricity index of trees with fixed pendent vertices and trees with fixed diameter
13. An Upper Bound for the 3-Tone Chromatic Number of Graphs with Maximum Degree 3
14. Some More Updates on an Annihilation Number Conjecture: Pros and Cons
15. Rainbow and Properly Colored Spanning Trees in Edge-Colored Bipartite Graphs
16. Decomposition of Complete Graphs into Arbitrary Trees
17. Closure and Spanning Trees with Bounded Total Excess
18. Weakly Protected Points in Ordered Trees
19. The Turán Numbers of Special Forests
20. The Generalized Turán Number of Spanning Linear Forests
21. Strong Edge Coloring of Cayley Graphs and Some Product Graphs
22. Spanning Triangle-Trees and Flows of Graphs
23. Trees with Unique Minimum Semitotal Dominating Sets
24. Packing Tree Degree Sequences
25. The Average Size of Matchings in Graphs
26. Bipartization of Graphs
27. Counting Vertices with Given Outdegree in Plane Trees and k-ary Trees
28. Characterizations of the Simple Non-Confusing Travel Groupoids on a Finite Graph
29. An Erdős–Gallai-Type Theorem for Keyrings
30. T-neighbor Systems and Travel Groupoids on a Graph
31. Spanning Tree Decompositions of Complete Graphs Orthogonal to Rotational 1-Factorizations
32. A Variation of the Erdős–Sós Conjecture in Bipartite Graphs
33. k-Protected Vertices in Unlabeled Rooted Plane Trees
34. Hamiltonian Laceability of Hypercubes Without Isometric Subgraphs
35. Generating and Enumerating Digitally Convex Sets of Trees
36. Bounds and Relations Involving Adjusted Centrality of the Vertices of a Tree
37. Permanental Bounds of the Laplacian Matrix of Trees with Given Domination Number
38. On Bounds for the Product Irregularity Strength of Graphs
39. The Minimal Number of Subtrees with a Given Degree Sequence
40. Indistinguishable Trees and Graphs
41. Some Progress on Total Bondage in Graphs
42. Extremal Zagreb Indices of Graphs with a Given Number of Cut Edges
43. Flip Graphs of Bounded Degree Triangulations
44. Iterated Joining of Rooted Trees
45. On Modular Edge-Graceful Graphs
46. Some Defective Parameters in Graphs
47. On the Ramsey Numbers of Trees with Small Diameter
48. Permanental Bounds for the Signless Laplacian Matrix of a Unicyclic Graph with Diameter d
49. Sums of Powers of the Degrees of Graphs with k Cut Edges
50. The Four-in-a-Tree Problem in Triangle-Free Graphs
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.