2-Distance coloring of planar graphs without adjacent 5-cycles

Yuehua Bu; Zewei Zhang; Hongguo Zhu

doi:10.1007/s10878-023-01053-2

ScienceGate Book Chapters

JOURNAL ARTICLE

2-Distance coloring of planar graphs without adjacent 5-cycles

Yuehua Bu Zewei Zhang Hongguo Zhu

Year: 2023 Journal: Journal of Combinatorial Optimization Vol: 45 (5) Publisher: Springer Science+Business Media

DOI: 10.1007/s10878-023-01053-2

Get Full-Text PDF Get Analytical Report

Keywords:

Combinatorics Mathematics Planar graph Graph Edge coloring Integer (computer science) Chromatic scale Complete coloring Discrete mathematics Graph power Computer science Line graph

Metrics

Cited By

0.62

FWCI (Field Weighted Citation Impact)

Refs

0.64

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Graph Labeling and Dimension Problems

Physical Sciences → Computer Science → Computational Theory and Mathematics

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

2-Distance coloring of planar graphs without adjacent 5-cycles

Metrics

Citation History

Topics

Related Documents

2-Distance Coloring of Planar Graphs without 4-Cycles and 5-Cycles

2-Distance coloring of planar graphs without short cycles

2-Distance Coloring of Planar Graphs Without 4,6-Cycles

2-distance coloring of planar graphs without 4, 6-cycles

List 2-distance coloring of planar graphs without short cycles