The following pages link to Sogol Jahanbekam (Q277618):
Displaying 22 items.
- On \(r\)-dynamic coloring of graphs (Q277619) (← links)
- Rainbow spanning subgraphs of small diameter in edge-colored complete graphs (Q292270) (← links)
- Large chromatic number and Ramsey graphs (Q367059) (← links)
- The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs (Q472134) (← links)
- (Q967353) (redirect page) (← links)
- On the list dynamic coloring of graphs (Q967354) (← links)
- A comment to: Two classes of edge domination in graphs (Q1003688) (← links)
- List coloring of graphs having cycles of length divisible by a given number (Q1011504) (← links)
- On the strong chromatic index of sparse graphs (Q1658764) (← links)
- Improved algorithm to determine 3-colorability of graphs with minimum degree at least 7 (Q2028085) (← links)
- Additive list coloring of planar graphs with given girth (Q2175242) (← links)
- List-distinguishing Cartesian products of cliques (Q2421867) (← links)
- Anti-Ramsey Problems for <i>t</i> Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees (Q2811196) (← links)
- (Q2936711) (← links)
- (Q3001393) (← links)
- (Q3001401) (← links)
- Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem (Q3449866) (← links)
- (Q4982919) (← links)
- List-antimagic labeling of vertex-weighted graphs (Q5024668) (← links)
- (Q5405504) (← links)
- Triangle-degree and triangle-distinct graphs (Q6080153) (← links)
- Weak dynamic coloring of planar graphs (Q6121912) (← links)
