52 results on '"Faudree A"'
Search Results
2. Forbidden subgraphs that imply 2-factors.
3. Weak saturation numbers for multiple copies.
4. Forbidden subgraphs that imply k-ordered and k-ordered hamiltonian.
5. Precise location of vertices on Hamiltonian cycles.
6. Locating pairs of vertices on Hamiltonian cycles.
7. Path spectra for trees.
8. Pancyclic graphs and linear forests.
9. tKp-saturated graphs of minimum size.
10. Degree conditions for hamiltonicity: Counting the number of missing edges.
11. A note on 2-factors with two components.
12. Toughness, degrees and 2-factors.
13. A note on powers of Hamilton cycles in generalized claw-free graphs.
14. Characterizing forbidden clawless triples implying hamiltonian graphs.
15. A note on hamiltonicity of generalized net-free graphs of large diameter.
16. Random induced graphs.
17. Survey of results on k-ordered graphs.
18. Edge disjoint monochromatic triangles in 2-colored graphs.
19. On the circumference of a graph and its complement.
20. On 2-factors in claw-free graphs.
21. The number of cycle lengths in graphs of given minimum degree and girth.
22. The maximum number of edges in a graph with fixed edge-degree.
23. Characterizing forbidden pairs for hamiltonian properties.
24. Claw-free graphs - A survey.
25. Graph spectra.
26. Degree sequence and independence in K(4)-free graphs.
27. Degree conditions and cycle extendability.
28. On the rotation distance of graphs.
29. Extremal problems and generalized degrees.
30. A local density condition for triangles.
31. A neighborhood condition which implies the existence of a complete multipartite subgraph.
32. Neighborhood unions and a generalization of Dirac's theorem.
33. On independent generalized degrees and independence numbers in K(1, m)-free graphs.
34. Extremal problems involving vertices and edges on odd cycles.
35. Irregularity strength of dense graphs.
36. Neighborhood conditions and edge-disjoint perfect matchings.
37. Subgraphs of minimal degree k.
38. Small order graph-tree Ramsey numbers.
39. Clique partitions and clique coverings.
40. Irregular networks, regular graphs and integer matrices with distinct row and column sums.
41. Ramsey numbers for all linear forests.
42. A Ramsey problem of Harary on graphs with prescribed size.
43. Size Ramsey numbers involving stars.
44. Extremal theory and bipartite graph-tree Ramsey numbers.
45. Induced matchings in bipartite graphs.
46. Ramsey-minimal graphs for forests.
47. Ramsey numbers for matchings.
48. Regular graphs and edge chromatic number.
49. Ramsey-minimal graphs for star-forests.
50. Theory of path length distributions I.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.