The following pages link to Li-Da Tong (Q186291):
Displaying 32 items.
- The minimum identifying code graphs (Q423972) (← links)
- Hamiltonian numbers of Möbius double loop networks (Q437052) (← links)
- Automorphisms of neighborhood sequence of a graph (Q514911) (← links)
- Non-cover generalized Mycielski, Kneser, and Schrijver graphs (Q942096) (← links)
- The convexity spectra of graphs (Q944736) (← links)
- Eccentric spectrum of a graph (Q947048) (← links)
- Full orientability of graphs with at most one dependent arc (Q967346) (← links)
- The \((a,b)\)-forcing geodetic graphs (Q1024478) (← links)
- The hull and geodetic numbers of orientations of graphs (Q1025467) (← links)
- The forcing hull and forcing geodetic numbers of graphs (Q1028447) (← links)
- Geodetic sets and Steiner sets in graphs (Q1043600) (← links)
- Independent arcs of acyclic orientations of complete \(r\)-partite graphs (Q1043945) (← links)
- The Hamiltonian property of the consecutive-3 digraphs (Q1368420) (← links)
- The linear 2-arboricity of planar graphs (Q1401562) (← links)
- Geodetic spectra of graphs. (Q1427436) (← links)
- Hamiltonian numbers in oriented graphs (Q1679516) (← links)
- A note on the Gallai-Roy-Vitaver theorem (Q1849952) (← links)
- The Hamiltonian numbers in digraphs (Q1956235) (← links)
- Hamiltonian spectra of graphs (Q2000574) (← links)
- Choice identification of a graph (Q2440100) (← links)
- On an interpolation property of outerplanar graphs (Q2581566) (← links)
- On properly ordered coloring of vertices in a vertex-weighted graph (Q2665834) (← links)
- (Q2828861) (← links)
- Full Orientability of Graphs (Q2851537) (← links)
- When is the Direct Product of Generalized Mycielskians a Cover Graph? (Q3462396) (← links)
- (Q4242729) (← links)
- (Q4262015) (← links)
- (Q4515736) (← links)
- (Q5463507) (← links)
- (Q5480727) (← links)
- On cycle sequences (Q5936098) (← links)
- Channel graphs of bit permutation networks (Q5941508) (← links)
