The following pages link to Ralph J. Faudree (Q175582):
Displaying 50 items.
- (Q234291) (redirect page) (← links)
- Locating pairs of vertices on a Hamiltonian cycle in bigraphs (Q293624) (← links)
- Locating sets of vertices on Hamiltonian cycles (Q298964) (← links)
- Multicolor on-line degree Ramsey numbers of trees (Q353401) (← links)
- Nearly complete graphs decomposable into large induced matchings and their applications (Q363228) (← links)
- A note on powers of Hamilton cycles in generalized claw-free graphs (Q383751) (← links)
- Precise location of vertices on Hamiltonian cycles (Q394220) (← links)
- (Q432695) (redirect page) (← links)
- Richard Schelp (1936-2010) (Q432697) (← links)
- Locating pairs of vertices on Hamiltonian cycles (Q442398) (← links)
- Chorded cycles (Q503621) (← links)
- A survey of minimum saturated graphs (Q554011) (← links)
- A lower bound for the CO-irredundance number of a graph (Q556836) (← links)
- Claw-free graphs. VI: Colouring (Q602712) (← links)
- Path spectra for trees (Q607002) (← links)
- A new class of Ramsey-Turán problems (Q607020) (← links)
- More counterexamples to the Alon-Saks-Seymour and rank-coloring conjectures (Q625392) (← links)
- Necessary and sufficient conditions for unit graphs to be Hamiltonian (Q627405) (← links)
- A neighborhood condition which implies the existence of a complete multipartite subgraph (Q685590) (← links)
- Irregularity strength of regular graphs of large degree (Q685644) (← links)
- No-hole \((r+1)\)-distant colorings (Q688267) (← links)
- Generalizing pancyclic and \(k\)-ordered graphs (Q704843) (← links)
- The chromatic gap and its extremes (Q713979) (← links)
- Weak saturation numbers for multiple copies (Q740652) (← links)
- Note on locating pairs of vertices on Hamiltonian cycles (Q742600) (← links)
- Subgraphs of minimal degree \(k\) (Q750456) (← links)
- Regular graphs and edge chromatic number (Q790826) (← links)
- How to make a graph bipartite (Q805628) (← links)
- The Ramsey number for hypergraph cycles. I. (Q817613) (← links)
- On Ramsey numbers of uniform hypergraphs with given maximum degree (Q855851) (← links)
- Loose Hamilton cycles in 3-uniform hypergraphs of high minimum degree (Q859609) (← links)
- Degree conditions for Hamiltonicity: counting the number of missing edges (Q868355) (← links)
- Making the components of a graph \(k\)-connected (Q868399) (← links)
- Minimum degree and the minimum size of \(K_2^t\)-saturated graphs (Q870972) (← links)
- The Ramsey number for a triple of long even cycles (Q885294) (← links)
- Induced subgraphs of Ramsey graphs with many distinct degrees (Q885296) (← links)
- On a neighborhood condition implying the existence of disjoint complete graphs (Q911615) (← links)
- Induced matchings in bipartite graphs (Q921017) (← links)
- On the minimum degree forcing \(F\)-free graphs to be (nearly) bipartite (Q932657) (← links)
- Linked graphs with restricted lengths (Q933678) (← links)
- Spanning 3-colourable subgraphs of small bandwidth in dense graphs (Q933679) (← links)
- Long paths with endpoints in given vertex-subsets of graphs (Q941396) (← links)
- Claw-free graphs. IV: Decomposition theorem (Q947722) (← links)
- Claw-free graphs. V. Global structure (Q958695) (← links)
- Ramsey numbers for a disjoint union of good graphs (Q968423) (← links)
- Some constructive bounds on Ramsey numbers (Q974470) (← links)
- Ramsey goodness and generalized stars (Q976142) (← links)
- Some three-color Ramsey numbers, \(R(P_4,P_5,C_k)\) and \(R(P_4,P_6,C_k)\) (Q1003590) (← links)
- The Ramsey number for a cycle of length six versus a clique of order eight (Q1003750) (← links)
- On Ramsey numbers of fans (Q1003775) (← links)
