The following pages link to Jian-hua Tu (Q403487):
Displayed 45 items.
- (Q397166) (redirect page) (← links)
- Rainbow numbers for matchings in plane triangulations (Q397167) (← links)
- An iterative rounding 2-approximation algorithm for the \(k\)-partial vertex cover problem (Q403490) (← links)
- A fixed-parameter algorithm for the vertex cover \(P_3\) problem (Q477591) (← links)
- A primal-dual approximation algorithm for the vertex cover \(P^3\) problem (Q650946) (← links)
- The unicyclic graphs with maximum degree resistance distance (Q668205) (← links)
- The generalized 3-connectivity of star graphs and bubble-sort graphs (Q668787) (← links)
- An FPT algorithm for the vertex cover \(P_4\) problem (Q906446) (← links)
- Heterochromatic tree partition numbers for complete bipartite graphs (Q932639) (← links)
- Bipartite rainbow numbers of matchings (Q1025529) (← links)
- Complete solution for the rainbow numbers of matchings (Q1025962) (← links)
- An efficient polynomial time approximation scheme for the vertex cover \(P_3\) problem on planar graphs (Q1630923) (← links)
- Inertia of complex unit gain graphs (Q1664249) (← links)
- The generalized 3-connectivity of Cayley graphs on symmetric groups generated by trees and cycles (Q1684938) (← links)
- A kind of conditional connectivity of Cayley graphs generated by wheel graphs (Q1735259) (← links)
- Efficient algorithm for the vertex cover \(P_k\) problem on cacti (Q1739987) (← links)
- A factor \(2\) approximation algorithm for the vertex cover \(P_3\) problem (Q1944113) (← links)
- The Turán number of star forests (Q2008823) (← links)
- A multi-start iterated greedy algorithm for the minimum weight vertex cover \(P_3\) problem (Q2008933) (← links)
- On tree-connectivity and path-connectivity of graphs (Q2053714) (← links)
- Polynomial time recognition of vertices contained in all (or no) maximum dissociation sets of a tree (Q2129757) (← links)
- Maximal and maximum dissociation sets in general and triangle-free graphs (Q2141169) (← links)
- Graph entropy based on the number of spanning forests of \(c\)-cyclic graphs (Q2286143) (← links)
- Complete characterization of bicyclic graphs with the maximum and second-maximum degree Kirchhoff index (Q2323474) (← links)
- Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth (Q2333222) (← links)
- The degree resistance distance of cacti (Q2345625) (← links)
- On the vertex cover \(P_3\) problem parameterized by treewidth (Q2410093) (← links)
- On the complexity of \(k\)-rainbow cycle colouring problems (Q2422742) (← links)
- The vertex cover \(P_3\) problem in cubic graphs (Q2444740) (← links)
- NP-completeness of 4-incidence colorability of semi-cubic graphs (Q2470012) (← links)
- On graph entropy measures based on the number of independent sets and matchings (Q2660906) (← links)
- Maximizing the number of independent sets in claw-free cubic graphs (Q2698077) (← links)
- (Q2828866) (← links)
- A 2-approximation algorithm for the vertex cover<i>P</i><sub>4</sub>problem in cubic graphs (Q2931950) (← links)
- (Q3403696) (← links)
- An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth (Q5207854) (← links)
- Bicyclic graphs with maximum degree resistance distance (Q5279449) (← links)
- (Q5408295) (← links)
- The maximum number of maximum dissociation sets in trees (Q6055404) (← links)
- Edge-diameter of a graph and its longest cycles (Q6133658) (← links)
- Maximum dissociation sets in subcubic trees (Q6176408) (← links)
- On the maximum number of maximum dissociation sets in trees with given dissociation number (Q6204327) (← links)
- Maximal and Maximum Dissociation Sets in General and Triangle-Free Graphs (Q6361886) (← links)
- A Survey on the k-Path Vertex Cover Problem (Q6387875) (← links)
- Heterochromatic tree partition number of a complete multipartite graph (Q6476340) (← links)