The following pages link to Zhong Fu Zhang (Q221702):
Displayed 50 items.
- (Q409466) (redirect page) (← links)
- Edge-chromatic numbers of Mycielski graphs (Q409467) (← links)
- On the adjacent vertex-distinguishing acyclic edge coloring of some graphs (Q453364) (← links)
- Erratum to: ``Vertex-distinguishing E-total colorings of graphs'' (Q458161) (← links)
- (Q601946) (redirect page) (← links)
- Some results on spanning trees (Q601948) (← links)
- Total chromatic number of graphs of high degree (Q805624) (← links)
- Relation between arboricities of a graph and its complement graph (Q807629) (← links)
- \(D(\beta)\)-vertex-distinguishing total coloring of graphs (Q867795) (← links)
- AVDTC numbers of generalized Halin graphs with maximum degree at least 6 (Q925977) (← links)
- On the adjacent-vertex-strongly-distinguishing total coloring of graphs (Q931507) (← links)
- On the relations of graph parameters and its total parameters (Q993698) (← links)
- Equitable total coloring of \(F_n \vee W_n\) (Q1036897) (← links)
- Adjacent strong edge colorings and total colorings of regular graphs (Q1041555) (← links)
- On total covers of graphs (Q1198645) (← links)
- On the relations between arboricity and independent number or covering number (Q1270790) (← links)
- A note on the lower bounds of signed domination number of a graph (Q1296996) (← links)
- Arboricity and complement of a graph (Q1299859) (← links)
- The complete chromatic number of some planar graphs (Q1312961) (← links)
- A short proof of Nash-Williams' theorem for the arboricity of a graph (Q1323488) (← links)
- On the complete chromatic number of Halin graphs (Q1363017) (← links)
- The lower bounds of classic Ramsey number \(R(5,9)\) and \(R(5,10)\) (Q1373831) (← links)
- A note on \(n\)-edge chromatic number (Q1387427) (← links)
- Some properties of Ramsey numbers (Q1433193) (← links)
- Adjacent strong edge coloring of graphs (Q1609524) (← links)
- A note on the total chromatic number of Halin graphs with maximum degree 4 (Q1808604) (← links)
- Bounds on the lower size of a 7-critical graph (Q1891429) (← links)
- A six-color theorem for the edge-face coloring of plane graphs (Q1894780) (← links)
- On the relations between the parameters of graphs (Q2372398) (← links)
- A note on adjacent strong edge coloring of \(K(n,m)\) (Q2431949) (← links)
- On defected colourings of graphs (Q2439252) (← links)
- Vertex distinguishing equitable total chromatic number of join graphs (Q2468789) (← links)
- Edge-face chromatic number of 2-connected plane graphs with high maximum degree (Q2507633) (← links)
- On adjacent-vertex-distinguishing total coloring of graphs (Q2574667) (← links)
- The relation of matching with inverse degree of a graph (Q2581633) (← links)
- (Q2715061) (← links)
- (Q2715188) (← links)
- (Q2715317) (← links)
- (Q2715347) (← links)
- (Q2747735) (← links)
- (Q2748761) (← links)
- (Q2748767) (← links)
- (Q2751019) (← links)
- (Q2788065) (← links)
- (Q2788226) (← links)
- (Q2864477) (← links)
- (Q2885693) (← links)
- (Q2919726) (← links)
- (Q3017669) (← links)
- (Q3024679) (← links)