The following pages link to Deepak Rajendraprasad (Q300473):
Displaying 41 items.
- Separation dimension of graphs and hypergraphs (Q300474) (← links)
- Rainbow colouring of split graphs (Q344835) (← links)
- Product dimension of forests and bounded treewidth graphs (Q396879) (← links)
- Rainbow connection number and connectivity (Q426778) (← links)
- Rainbow connection number of graph power and graph products (Q489302) (← links)
- The induced separation dimension of a graph (Q722529) (← links)
- Rainbow connection number and radius (Q742568) (← links)
- 2-connecting outerplanar graphs without blowing up the pathwidth (Q744095) (← links)
- Partial list colouring of certain graphs (Q888600) (← links)
- Upper bound on cubicity in terms of boxicity for graphs of low chromatic number (Q898085) (← links)
- Track number of line graphs (Q1630705) (← links)
- Edge-intersection graphs of boundary-generated paths in a grid (Q1693146) (← links)
- Hamiltonian and pseudo-Hamiltonian cycles and fillings in simplicial complexes (Q2040016) (← links)
- Characterization of \(\mathrm{B}_0\)-VPG cocomparability graphs and a 2D visualization of their posets (Q2088073) (← links)
- On graphs whose eternal vertex cover number and vertex cover number coincide (Q2161248) (← links)
- New bounds on the Ramsey number \(r ( I_m , L_n )\) (Q2222964) (← links)
- An improvement to Chvátal and Thomassen's upper bound for oriented diameter (Q2231791) (← links)
- On graphs with minimal eternal vertex cover number (Q2326577) (← links)
- Boxicity and cubicity of product graphs (Q2346582) (← links)
- Heterochromatic paths in edge colored graphs without small cycles and heterochromatic-triangle-free graphs (Q2346583) (← links)
- Dimension of CPT posets (Q2663165) (← links)
- (Q2857351) (← links)
- Rainbow connection number and connected dominating sets (Q2911064) (← links)
- Rainbow Colouring of Split and Threshold Graphs (Q2914323) (← links)
- Boxicity and Separation Dimension (Q2945181) (← links)
- Inapproximability of Rainbow Colouring (Q2963907) (← links)
- Induced Separation Dimension (Q3181052) (← links)
- Separation Dimension of Bounded Degree Graphs (Q3453564) (← links)
- Separation dimension and sparsity (Q4553724) (← links)
- Testing for Forbidden Order Patterns in an Array (Q4575847) (← links)
- 2-connecting Outerplanar Graphs without Blowing Up the Pathwidth (Q4925277) (← links)
- Characterization and a 2D Visualization of B$$_{0}$$-VPG Cocomparability Graphs (Q5014117) (← links)
- An Improvement to Chvátal and Thomassen’s Upper Bound for Oriented Diameter (Q5042233) (← links)
- On Additive Combinatorics of Permutations of \mathbb{Z}_n (Q5167718) (← links)
- Testing for forbidden order patterns in an array (Q5242883) (← links)
- (Q5419971) (← links)
- Oriented diameter of star graphs (Q5896108) (← links)
- Improved bounds for the oriented radius of mixed multigraphs (Q6047957) (← links)
- Packing arc-disjoint cycles in oriented graphs (Q6126480) (← links)
- New bounds on the anti-Ramsey numbers of star graphs via maximum edge \(q\)-coloring (Q6197752) (← links)
- B0-VPG Representation of AT-free Outerplanar Graphs (Q6202310) (← links)
