The following pages link to Xue Liang Li (Q831023):
Displaying 50 items.
- Partitioning complete graphs by heterochromatic trees (Q692699) (← links)
- The chromaticity of certain complete multipartite graphs (Q704831) (← links)
- Removable edges in longest cycles of 4-connected graphs (Q704835) (← links)
- Trees with a given order and matching number that have maximum general Randić index (Q708366) (← links)
- On a relation between the Randić index and the chromatic number (Q708405) (← links)
- The \((k,\ell )\)-proper index of graphs (Q721930) (← links)
- Proper connection numbers of complementary graphs (Q723592) (← links)
- All hypoenergetic graphs with maximum degree at most 3 (Q734925) (← links)
- The rainbow number of matchings in regular bipartite graphs (Q735110) (← links)
- Note on minimally \(d\)-rainbow connected graphs (Q742605) (← links)
- Degree powers in \(C_5\)-free graphs (Q745946) (← links)
- Extremal graphs with maximum monochromatic connectivity (Q776294) (← links)
- The asymptotic value of graph energy for random graphs with degree-based weights (Q777425) (← links)
- More on limited packings in graphs (Q782753) (← links)
- The rainbow vertex-disconnection in graphs (Q831025) (← links)
- Maximum energy trees with two maximum degree vertices (Q839346) (← links)
- Note on the energy of regular graphs (Q847201) (← links)
- Connected \((n,m)\)-graphs with minimum and maximum zeroth-order general Randić index (Q881585) (← links)
- A characterization of graphs without even factors (Q882784) (← links)
- The asymptotic number of non-isomorphic rooted trees obtained by rooting a tree (Q890484) (← links)
- Proper connection number and connected dominating sets (Q896128) (← links)
- On extremal graphs with at most \(\ell\) internally disjoint Steiner trees connecting any \(n-1\) vertices (Q897279) (← links)
- Proper connection number of random graphs (Q897901) (← links)
- The 2nd-order conditional 3-coloring of claw-free graphs (Q924141) (← links)
- Heterochromatic tree partition numbers for complete bipartite graphs (Q932639) (← links)
- Vertex partitions of \(r\)-edge-colored graphs (Q933003) (← links)
- The general \(\sigma \) all-ones problem for trees (Q944730) (← links)
- A proof of a conjecture on the Randić index of graphs with given girth (Q967390) (← links)
- The Laplacian energy of random graphs (Q972485) (← links)
- Sharp bounds for the generalized connectivity \(\kappa _{3}(G)\) (Q982621) (← links)
- Some families of integral graphs (Q998379) (← links)
- Graphs with the second largest number of maximal independent sets (Q998481) (← links)
- Complexity of conditional colorability of graphs (Q1003864) (← links)
- The neighbour-scattering number can be computed in polynomial time for interval graphs (Q1005803) (← links)
- Color neighborhood union conditions for long heterochromatic paths in edge-colored graphs (Q1010637) (← links)
- Nonexistence of triples of nonisomorphic connected graphs with isomorphic connected \(P_{3}\)-graphs (Q1010739) (← links)
- Partitioning 3-edge-colored complete equi-bipartite graphs by monochromatic trees under a color degree condition (Q1010866) (← links)
- Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey (Q1014813) (← links)
- On the determination problem for \(P_{4}\)-transformation of graphs (Q1015433) (← links)
- Bipartite rainbow numbers of matchings (Q1025529) (← links)
- Complete solution for the rainbow numbers of matchings (Q1025962) (← links)
- On bipartite graphs with minimal energy (Q1028491) (← links)
- Complete solution to a conjecture on the Randić index of triangle-free graphs (Q1045031) (← links)
- On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs (Q1182967) (← links)
- Digraph categories and line digraph functors (Q1200109) (← links)
- Hexagonal systems with fixed bonds (Q1314342) (← links)
- Clique polynomials and independent set polynomials of graphs (Q1322274) (← links)
- Hamiltonicity of a type of interchange graphs (Q1329809) (← links)
- \(n\)-dimensional line digraphs (Q1336657) (← links)
- A fan type condition for heavy cycles in weighted graphs (Q1348663) (← links)