The following pages link to Baoyindureng Wu (Q244910):
Displaying 50 items.
- Proof of a conjecture on the zero forcing number of a graph (Q313827) (← links)
- Remoteness and distance eigenvalues of a graph (Q323085) (← links)
- Maximum size of digraphs with some parameters (Q326498) (← links)
- Proof of a conjecture of Z.-W. Sun on ratio monotonicity (Q338892) (← links)
- A note on semi-coloring of graphs (Q354428) (← links)
- Minimum degree, edge-connectivity and radius (Q385477) (← links)
- \([1,2]\)-domination in graphs (Q401141) (← links)
- Proof of a conjecture on connectivity of Kronecker product of graphs (Q409372) (← links)
- Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs (Q427574) (← links)
- Proximity and average eccentricity of a graph (Q436337) (← links)
- Domination of maximal \(K_4\)-minor free graphs and maximal \(K_{2, 3}\)-minor free graphs, and disproofs of two conjectures on planar graphs (Q494435) (← links)
- A weaker version of a conjecture on list vertex arboricity of graphs (Q497380) (← links)
- More bounds for the Grundy number of graphs (Q511707) (← links)
- Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree (Q512863) (← links)
- Upper bounds for the achromatic and coloring numbers of a graph (Q516843) (← links)
- Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts (Q642989) (← links)
- Randić index and coloring number of a graph (Q741549) (← links)
- Hamiltonicity of complements of middle graphs (Q870983) (← links)
- A complete \(L (2, 1)\) span characterization for small trees (Q896092) (← links)
- Two-log-convexity of the Catalan-Larcombe-French sequence (Q903202) (← links)
- The minimum number of vertices for a triangle-free graph with \(\chi _l(G)=4\) is \(11\) (Q998415) (← links)
- List point arboricity of dense graphs (Q1043798) (← links)
- Total \([1,2]\)-domination in graphs (Q1617038) (← links)
- On \((t-1)\)-colored paths in \(t\)-colored complete graphs (Q1656293) (← links)
- Making a dominating set of a graph connected (Q1656909) (← links)
- Nordhaus-Gaddum type result for the matching number of a graph (Q1680497) (← links)
- Edge-disjoint spanning trees and the number of maximum state circles of a graph (Q1752609) (← links)
- Steiner tree packing number and tree connectivity (Q1752665) (← links)
- On Reichenbach's causal betweenness (Q1758556) (← links)
- Hamiltonian jump graphs (Q1763338) (← links)
- Edge choosability of planar graphs without small cycles (Q1827800) (← links)
- Paired-domination number of claw-free odd-regular graphs (Q2012885) (← links)
- The hub number, girth and Mycielski graphs (Q2015153) (← links)
- Disproofs of two conjectures on no hole anti-\(n\)-labeling of graphs (Q2030247) (← links)
- Graphs in which \(G - N[v]\) is a cycle for each vertex \(v\) (Q2037597) (← links)
- Proof of a conjecture on the strong chromatic index of Halin graphs (Q2043362) (← links)
- On the \(k\)-component independence number of a tree (Q2045314) (← links)
- Disproofs of three conjectures on the power domination of graphs (Q2057589) (← links)
- Admissible property of graphs in terms of radius (Q2062891) (← links)
- Super domination in trees (Q2071243) (← links)
- On \(S\)-packing edge-colorings of graphs with small edge weight (Q2073113) (← links)
- Admissible property of graphs in terms of independence number (Q2082373) (← links)
- On \([j, k]\)-sets in graphs (Q2091155) (← links)
- Injective edge-coloring of graphs with small weight (Q2093106) (← links)
- Broadcast domination in subcubic graphs (Q2093109) (← links)
- Disproof of a conjecture on the rainbow triangles in arc-colored digraphs (Q2097174) (← links)
- Induced subgraphs of a tree with constraint degree (Q2101934) (← links)
- Harmonic index of a line graph (Q2104949) (← links)
- Perfect domination polynomial of homogeneous caterpillar graphs and of full binary trees (Q2113431) (← links)
- Arbitrarily partitionable \(\{2K_2, C_4\}\)-free graphs (Q2118240) (← links)
