Jihui Wang

Available identifiers

List of research outcomes

Publication	Date of Publication	Type
CLBA: a Coulomb's law based algorithm for community detection in directed networks	2024-09-19	Paper
Second neighborhood via probabilistic argument	2024-05-06	Paper
Majority choosability of 1-planar digraph	2023-08-17	Paper
The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11	2022-03-28	Paper
https://portal.mardi4nfdi.de/entity/Q5033142	2022-02-22	Paper
Neighbor sum distinguishing index of sparse graphs	2020-09-07	Paper
Tetravalent half-arc-transitive graphs of order \(8p\)	2020-03-06	Paper
Improved upper bound for acyclic chromatic number of graphs.	2019-12-18	Paper
Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)	2018-02-13	Paper
Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles	2017-01-09	Paper
A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles	2016-08-31	Paper
Neighbor sums distinguishing total colorings of planar graphs without short cycles	2016-06-10	Paper
Neighbor sum distinguishing total choosability of planar graphs without 4-cycles	2016-05-02	Paper
Tetravalent half-arc-transitive graphs of order a product of three primes	2016-04-07	Paper
Neighbor sum distinguishing total colorings of triangle free planar graphs	2015-07-23	Paper
Neighbor sum distinguishing index of planar graphs	2014-08-14	Paper
A note on edge-choosability of planar graphs without intersecting 4-cycles	2011-06-22	Paper
https://portal.mardi4nfdi.de/entity/Q3070254	2011-02-02	Paper
Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles	2011-01-20	Paper
Some results on fractional edge coloring of graphs.	2009-05-06	Paper
The construction of edge covered critical graphs	2008-08-06	Paper
\(L(p,q)\)-labelling of planar graphs with high maximum degree	2008-04-04	Paper
Some properties on \(f\)-edge covered critical graphs	2007-10-22	Paper
Edge covering coloring of nearly bipartite graphs	2006-12-04	Paper

Research outcomes over time

This page was built for person: Jihui Wang