Tao-Ming Wang

Orcid: 0000-0002-3432-8579

According to our database1, Tao-Ming Wang authored at least 29 papers between 1999 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
On Local Antimagic Vertex Coloring for Complete Full <i>t</i>-ary Trees.
Fundam. Informaticae, 2022

2020
Local Face Antimagic Evaluations and Coloring of Plane Graphs.
Fundam. Informaticae, 2020

2018
On edge-graceful labeling and deficiency for regular graphs.
AKCE Int. J. Graphs Comb., 2018

Fault-Hamiltonicity of Cartesian products of directed cycles.
Art Discret. Appl. Math., 2018

2017
On Edge-Graceful Regular Graphs with Particular 3-Factors.
Electron. Notes Discret. Math., 2017

Preface.
Electron. Notes Discret. Math., 2017

On the Grundy number of Cameron graphs.
Electron. Notes Discret. Math., 2017

2016
On complexities of minus domination.
Discret. Optim., 2016

P_3-Games on Chordal Bipartite Graphs.
CoRR, 2016

P_3-Games.
CoRR, 2016

2015
On (a, 1)-Vertex-Antimagic Edge Labeling of Regular Graphs.
J. Appl. Math., 2015

On Hamiltonian properties of unidirectional hypercubes.
Inf. Process. Lett., 2015

E-Super Vertex Magic Regular Graphs of Odd Degree.
Electron. Notes Discret. Math., 2015

On Zero Magic Sums of Integer Magic Graphs.
Ars Comb., 2015

2014
Note on E-super vertex magic graphs.
Discret. Appl. Math., 2014

Zero-Sum Flow Numbers of Triangular Grids.
Proceedings of the Frontiers in Algorithmics - 8th International Workshop, 2014

2013
On antimagic labeling of regular graphs with particular factors.
J. Discrete Algorithms, 2013

Zero-Sum Flow Numbers of Hexagonal Grids.
Proceedings of the Frontiers in Algorithmics <i>and</i> Algorithmic Aspects in Information and Management, 2013

2012
On Antimagic Labeling of Odd Regular Graphs.
Proceedings of the Combinatorial Algorithms, 23rd International Workshop, 2012

Zero-Sum Flow Numbers of Regular Graphs.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2012

2011
Unique intersectability of diamond-free graphs.
Discret. Appl. Math., 2011

Constant Sum Flows in Regular Graphs.
Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2008
A note on edge-graceful spectra of the square of paths.
Discret. Math., 2008

On anti-magic labeling for graph products.
Discret. Math., 2008

On Irreducibility of Maximal Cliques.
Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008

L(2, 1)-labellings of integer distance graphs.
Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008

2005
On line graphs which are weakly maximal clique irreducible.
Ars Comb., 2005

Toroidal Grids Are Anti-magic.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

1999
On uniquely intersectable graphs.
Discret. Math., 1999


  Loading...