A5100376805- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- graph theory and CDMA systems
- Computational Geometry and Mesh Generation
- Graph theory and applications
- Complex Network Analysis Techniques
- Limits and Structures in Graph Theory
- Complexity and Algorithms in Graphs
- Opinion Dynamics and Social Influence
- Interconnection Networks and Systems
- Optimization and Search Problems
- Blockchain Technology Applications and Security
- Advancements in Transdermal Drug Delivery
- Cryptography and Data Security
- Food Quality and Safety Studies
- Stochastic processes and statistical mechanics
- Currency Recognition and Detection
- Advanced Drug Delivery Systems
- Numerical methods in engineering
- Food Supply Chain Traceability
- Supply Chain and Inventory Management
- Olfactory and Sensory Function Studies
- Fermentation and Sensory Analysis
- Mobile Crowdsensing and Crowdsourcing
- Sensory Analysis and Statistical Methods
Qingdao University
2015-2024
Northwest A&F University
2023
Agricultural Information Institute
2021
First Research Institute of the Ministry of Public Security
2020
Delft University of Technology
2019
South China University of Technology
2014
Shandong University
2012-2014
Inner Mongolia Normal University
2014
Hetao College
2014
Shanghai Innovative Research Center of Traditional Chinese Medicine
2013
Let G be a planar graph with Δ⩾8 and without adjacent cycles of size i j, for some 3⩽i⩽j⩽5. In this paper, it is proved that (Δ+1)-total-colorable.
The total chromatic number of a graph $G$, denoted by $\chi′′(G)$, is the minimum colors needed to color vertices and edges $G$ such that no two adjacent or incident elements get same color. It known if planar has maximum degree $\Delta ≥ 9$, then $\chi′′(G) = \Delta + 1$. join $K_1 \vee P_n$ $K_1$ $P_n$ called fan $F_n$. In this paper, we prove $F_5$-free with 8, 9$.