According to our database
1,
Guanghui Wang
authored at least 85 papers
between 2007 and 2023.
Collaborative distances:
-
Dijkstra number2 of
four.
-
Erdős number3 of
two.
2023
Shape of the asymptotic maximum sum-free sets in integer lattice grids.
Eur. J. Comb., 2023
2022
Efficient Algorithm Based on Non-Backtracking Matrix for Community Detection in Signed Networks.
IEEE Trans. Netw. Sci. Eng., 2022
Clique immersion in graphs without a fixed bipartite graph.
J. Comb. Theory, Ser. B, 2022
Stable structural clustering in uncertain graphs.
Inf. Sci., 2022
Integer colorings with no rainbow k-term arithmetic progression.
Eur. J. Comb., 2022
Properly colored short cycles in edge-colored graphs.
Eur. J. Comb., 2022
On the Message Passing Efficiency of Polar and Low-Density Parity-Check Decoders.
Proceedings of the IEEE Globecom 2022 Workshops, 2022
2021
Information spreading with relative attributes on signed networks.
Inf. Sci., 2021
Search for Good Irregular Low-Density Parity-Check Codes Via Graph Spectrum.
Proceedings of the 32nd IEEE Annual International Symposium on Personal, 2021
The K-Core Decomposition Algorithm Under the Framework of GraphBLAS.
Proceedings of the 2021 IEEE High Performance Extreme Computing Conference, 2021
2020
Local antimagic orientation of graphs.
J. Comb. Optim., 2020
The evolution of structural balance in time-varying signed networks.
Future Gener. Comput. Syst., 2020
Properly colored spanning trees in edge-colored graphs.
Discret. Math., 2020
Improved bounds for neighbor sum (set) distinguishing choosability of planar graphs.
Discret. Math., 2020
Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8.
Discret. Math., 2020
Temporal Gravity Model for Important Nodes Identification in Temporal Networks.
CoRR, 2020
Non-backtracking Operator for Community Detection in Signed Networks.
CoRR, 2020
2019
Antimagic orientations of even regular graphs.
J. Graph Theory, 2019
Adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least 10.
J. Comb. Optim., 2019
Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9.
Discret. Math., 2019
Graphs are (1, Δ+1)-choosable.
Discret. Math., 2019
Rainbow Hamiltonian cycles in strongly edge-colored graphs.
Discret. Math., 2019
Local antimagic orientations of d-degenerate graphs.
Discret. Appl. Math., 2019
Decomposing edge-coloured graphs under colour degree constraints.
Comb. Probab. Comput., 2019
Rainbow Matchings in Properly-Colored Hypergraphs.
Electron. J. Comb., 2019
2018
Generalized acyclic edge colorings via entropy compression.
J. Comb. Optim., 2018
Multipolarization versus unification in community networks.
Future Gener. Comput. Syst., 2018
Strong list-chromatic index of subcubic graphs.
Discret. Math., 2018
A note on rainbow matchings in strongly edge-colored graphs.
Discret. Math., 2018
Local antimagic labeling of graphs.
Appl. Math. Comput., 2018
2017
Social media as sensor in real world: movement trajectory detection with microblog.
Soft Comput., 2017
Neighbor sum distinguishing total coloring of 2-degenerate graphs.
J. Comb. Optim., 2017
Neighbor product distinguishing total colorings.
J. Comb. Optim., 2017
The adjacent vertex distinguishing total chromatic numbers of planar graphs Δ = 10.
J. Comb. Optim., 2017
Equitable vertex arboricity of 5-degenerate graphs.
J. Comb. Optim., 2017
HAMDA: Hybrid Approach for MiRNA-Disease Association prediction.
J. Biomed. Informatics, 2017
Neighbor Sum (Set) Distinguishing Total Choosability Via the Combinatorial Nullstellensatz.
Graphs Comb., 2017
Decomposing edge-colored graphs under color degree constraints.
Electron. Notes Discret. Math., 2017
2016
On the neighbor sum distinguishing total coloring of planar graphs.
Theor. Comput. Sci., 2016
Neighbor sum distinguishing total choosability of planar graphs.
J. Comb. Optim., 2016
Neighbor Sum Distinguishing Index of K<sub>4</sub>-Minor Free Graphs.
Graphs Comb., 2016
Neighbor Sum (Set) Distinguishing Total Choosability of d-Degenerate Graphs.
Graphs Comb., 2016
A Relaxed Case on 1-2-3 Conjecture.
Graphs Comb., 2016
Adjacent vertex distinguishing colorings by sum of sparse graphs.
Discret. Math., 2016
Existence of rainbow matchings in strongly edge-colored graphs.
Discret. Math., 2016
2015
The r-acyclic chromatic number of planar graphs.
J. Comb. Optim., 2015
Neighbor sum distinguishing total colorings of planar graphs.
J. Comb. Optim., 2015
An Improved Upper Bound on Edge Weight Choosability of Graphs.
Graphs Comb., 2015
Orthogonal matchings revisited.
Discret. Math., 2015
Neighbor sum distinguishing total colorings of planar graphs with maximum degree Δ.
Discret. Appl. Math., 2015
2014
Domatic partition in homogeneous wireless sensor networks.
J. Netw. Comput. Appl., 2014
The Linear t-Colorings of Sierpiński-Like Graphs.
Graphs Comb., 2014
Fractional f-Edge Cover Chromatic Index of Graphs.
Graphs Comb., 2014
A note on Edge Weight choosability of graphs.
Discret. Math. Algorithms Appl., 2014
Long properly colored cycles in edge colored complete graphs.
Discret. Math., 2014
Neighbor sum distinguishing index of planar graphs.
Discret. Math., 2014
Shortest paths in Sierpiński graphs.
Discret. Appl. Math., 2014
An improved upper bound for the neighbor sum distinguishing index of graphs.
Discret. Appl. Math., 2014
ECDC: An energy and coverage-aware distributed clustering protocol for wireless sensor networks.
Comput. Electr. Eng., 2014
2013
A note on Rainbow Matchings.
Discret. Math. Algorithms Appl., 2013
Equitable and list equitable colorings of planar graphs without 4-cycles.
Discret. Math., 2013
Connected dominating sets in wireless ad hoc and sensor networks - A comprehensive survey.
Comput. Commun., 2013
2012
Constructing minimum extended weakly-connected dominating sets for clustering in ad hoc networks.
J. Parallel Distributed Comput., 2012
A Stochastic <i>k</i>-Coverage Scheduling Algorithm in Wireless Sensor Networks.
Int. J. Distributed Sens. Networks, 2012
Clustering-Based Energy-Efficient Broadcast Tree in Wireless Networks.
Int. J. Comput. Commun. Control, 2012
A Note on Heterochromatic C 4 in Edge-Colored Triangle-Free Graphs.
Graphs Comb., 2012
Circular Coloring of Planar Digraphs.
Graphs Comb., 2012
Color degree and heterochromatic cycles in edge-colored graphs.
Eur. J. Comb., 2012
Neighbor Sum Distinguishing Coloring of some Graphs.
Discret. Math. Algorithms Appl., 2012
On r-acyclic edge colorings of planar graphs.
Discret. Appl. Math., 2012
2011
Circular vertex arboricity.
Discret. Appl. Math., 2011
Improved bounds for acyclic chromatic index of planar graphs.
Discret. Appl. Math., 2011
(2,1)-Total labeling of planar graphs with large maximum degree
CoRR, 2011
2010
Algorithm for two disjoint long paths in 2-connected graphs.
Theor. Comput. Sci., 2010
The k-dominating cycles in graphs.
Eur. J. Comb., 2010
Heuristic Algorithms for Constructing Connected Dominating Sets with Minimum Size and Bounded Diameter in Wireless Networks.
Proceedings of the Wireless Algorithms, 2010
2009
Paths, cycles and circular colorings in digraphs.
Theor. Comput. Sci., 2009
Color degree and alternating cycles in edge-colored graphs.
Discret. Math., 2009
The heterochromatic matchings in edge-colored bipartite graphs.
Ars Comb., 2009
An Algorithm with Better Approximation Ratio for Multicast Traffic in Unidirectional SONET/WDM Rings.
Proceedings of the Combinatorial Optimization and Applications, 2009
Approximating the Multicast Traffic Grooming Problem in Unidirectional SONET/WDM Rings.
Proceedings of the Combinatorial Optimization and Applications, 2009
2008
Heterochromatic Matchings in Edge-Colored Graphs.
Electron. J. Comb., 2008
2007
A Note on <i>k</i> -walks in Bridgeless Graphs.
Graphs Comb., 2007
Long Alternating Cycles in Edge-Colored Complete Graphs.
Proceedings of the Frontiers in Algorithmics, First Annual International Workshop, 2007
