1-Planar graphs with no 5-cycles are 5-degenerate

IF 3.5 2区数学 Q1 MATHEMATICS, APPLIED

Applied Mathematics and Computation Pub Date : 2025-01-20 DOI:10.1016/j.amc.2025.129304

Qingqin Wu , Weifan Wang , Jiangxu Kong

引用次数: 0

Abstract

A graph is 1-planar if it can be drawn in the plane so that each edge is crossed by at most one other edge. A graph is k-degenerate if each of its subgraphs contains a vertex of degree no greater than k. It was known that 1-planar graphs are 7-degenerate. In this paper, we show that every 1-planar graph without 5-cycles is 5-degenerate, which extends some known results on the 5-degeneracy of some 1-planar graphs.

查看原文本刊更多论文

求助全文

约1分钟内获得全文求助全文

来源期刊

Applied Mathematics and Computation 数学-应用数学

CiteScore

7.90

自引率

10.00%

发文量

755

审稿时长

36 days

期刊介绍： Applied Mathematics and Computation addresses work at the interface between applied mathematics, numerical computation, and applications of systems – oriented ideas to the physical, biological, social, and behavioral sciences, and emphasizes papers of a computational nature focusing on new algorithms, their analysis and numerical results. In addition to presenting research papers, Applied Mathematics and Computation publishes review articles and single–topics issues.