On total coloring of 1-planar graphs without 4-cycles

A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we confirm the total-coloring conjecture for 1-planar graphs without 4-cycles with maximum degree

Authors

Publication Details

Journal
Ars Combinatoria
Published
2025-03-22
DOI
https://doi.org/10.61091/ars162-07
Primary Topic
Advanced Graph Theory Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

On total coloring of 1-planar graphs without 4-cycles

Wenyao Song, Weiping Ni
Ars Combinatoria
Advanced Graph Theory Research
article

On total coloring of 1-planar graphs without 4-cycles

Wenyao Song, Weiping Ni
article en

Abstract

A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, we confirm the total-coloring conjecture for 1-planar graphs without 4-cycles with maximum degree

Ars CombinatoriaVol. 162
Openalex Percentile: Top 94%
Advanced Graph Theory Research
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.