The following pages link to Xueliang Li (Q831023):
Displaying 50 items.
- Digraphs with proper connection number two (Q2034401) (← links)
- Complexity results for the proper disconnection of graphs (Q2037957) (← links)
- Complexity results for two kinds of colored disconnections of graphs (Q2045036) (← links)
- Proper disconnection of graphs (Q2045273) (← links)
- Rainbow monochromatic \(k\)-edge-connection colorings of graphs (Q2045397) (← links)
- Further results on the rainbow vertex-disconnection of graphs (Q2049030) (← links)
- Conflict-free connection of trees (Q2051900) (← links)
- Rainbow edge-pancyclicity of strongly edge-colored graphs (Q2077375) (← links)
- Monochromatic-degree conditions for properly colored cycles in edge-colored complete graphs (Q2092426) (← links)
- Extremal quasi-unicyclic graphs with respect to the general multiplicative Zagreb indices (Q2104938) (← links)
- Bounds for the rainbow disconnection numbers of graphs (Q2115196) (← links)
- Hypergraph Turán numbers of vertex disjoint cycles (Q2115235) (← links)
- On the 12-representability of induced subgraphs of a grid graph (Q2118234) (← links)
- Vertex coloring \((4K_1\), hole-twin, 5-wheel)-free graphs (Q2124227) (← links)
- Validity of Akbari's energy conjecture for threshold graphs (Q2134957) (← links)
- Vertex-disjoint rainbow cycles in edge-colored graphs (Q2138972) (← links)
- Edge-disjoint rainbow triangles in edge-colored graphs (Q2146736) (← links)
- Monochromatic vertex-disconnection colorings of graphs (Q2147602) (← links)
- More on the rainbow disconnection in graphs (Q2158198) (← links)
- The crossing number of twisted graphs (Q2163801) (← links)
- Monochromatic disconnection: Erdős-Gallai-type problems and product graphs (Q2168716) (← links)
- Further results on the total monochromatic connectivity of graphs (Q2168754) (← links)
- Bounds on the \(ABC\) spectral radius and \(ABC\) energy of graphs (Q2173327) (← links)
- Compatible spanning circuits in edge-colored graphs (Q2182217) (← links)
- New restrictions on defective coloring with applications to Steinberg-type graphs (Q2185826) (← links)
- Conflict-free connection number of random graphs (Q2192106) (← links)
- The asymptotic value of energy for matrices with degree-distance-based entries of random graphs (Q2197147) (← links)
- Counting directed acyclic and elementary digraphs (Q2199812) (← links)
- Spectral properties of inverse sum indeg index of graphs (Q2201048) (← links)
- Hardness results for three kinds of colored connections of graphs (Q2202016) (← links)
- Monochromatic disconnection of graphs (Q2208356) (← links)
- On proper (strong) rainbow connection of graphs (Q2227108) (← links)
- The vertex-rainbow connection number of some graph operations (Q2227111) (← links)
- Asymptotic values of four Laplacian-type energies for matrices with degree-distance-based entries of random graphs (Q2228530) (← links)
- The \(h\)-restricted connectivity of balanced hypercubes (Q2235266) (← links)
- On the eigenvalue and energy of extended adjacency matrix (Q2242073) (← links)
- The 3-rainbow index of a graph (Q2259571) (← links)
- Graphs with 3-rainbow index \(n-1\) and \(n-2\) (Q2259573) (← links)
- On the total proper connection of graphs (Q2272614) (← links)
- Monochromatic \(k\)-edge-connection colorings of graphs (Q2280002) (← links)
- Conflict-free vertex-connections of graphs (Q2282464) (← links)
- (Strong) conflict-free connectivity: algorithm and complexity (Q2283032) (← links)
- Strong conflict-free connection of graphs (Q2284053) (← links)
- Binding number conditions for \(P_{\geq 2}\)-factor and \(P_{\geq 3}\)-factor uniform graphs (Q2286579) (← links)
- Adjacency rank and independence number of a signed graph (Q2302068) (← links)
- Complementary graphs with flows less than three (Q2305923) (← links)
- The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum (Q2306004) (← links)
- On the ABC spectra radius of unicyclic graphs (Q2309679) (← links)
- Extremality of graph entropy based on degrees of uniform hypergraphs with few edges (Q2311742) (← links)
- Erdős-Gallai-type results for total monochromatic connection of graphs (Q2312052) (← links)
