학술
기타
AVD Total Coloring of Central Graphs, Subdivision Graphs, and the Join of Graphs
arXiv Math
조회 0
이 뉴스, 어떠셨어요?
한 번의 탭으로 반응을 남겨요 · 로그인 불필요
CC BY
이 매체는 공공·자유 라이선스로 본문을 직접 표시합니다.Abstract
In 2020, Panda, Verma, and Keerti asked whether the central graph of every graph satisfies the AVD-total coloring conjecture.
In this paper, we verify the conjecture for central graphs of regular graphs, complete bipartite graphs, graphs that can be expressed as the join of two graphs of the same order, and several other graph classes, thereby providing partial progress towards this open problem.
We further determine the AVD-total chromatic number of subdivision graphs and establish new results on the AVD-total coloring of joins of graphs.
관련 뉴스
관련 뉴스 제보는 로그인 후 가능합니다.
'research' 카테고리 뉴스
arXiv의 다른 기사
CreativityNeuro: Steering Language Model Weights to Improve Divergent Thinking and Reduce Mode Collapse
arXiv CS.AI
Discrete Diffusion Language Models for Interactive Radiology Report Drafting
arXiv CS.AI
Beyond Next-Token Prediction: An RLVR Proof of Concept for Tool-Use Agents on Atlassian Workflows
arXiv CS.AI