Generation of 3-connected, planar line graphs

IF 0.7 3区数学 Q2 MATHEMATICS Discrete Mathematics Pub Date : 2024-10-30 DOI:10.1016/j.disc.2024.114302

引用次数: 0

Abstract

We classify and construct all line graphs that are 3-polytopes (planar and 3-connected). Apart from a few special cases, they are all obtained starting from the medial graphs of cubic (i.e., 3-regular) 3-polytopes, by applying two types of graph transformations. This is similar to the generation of other subclasses of 3-polytopes [6], [13].

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

生成三连平面线图

我们对所有属于 3 多面体（平面和 3 连接）的线图进行了分类和构造。除少数特例外，它们都是从立方（即 3-不规则）3-多面体的中间图开始，通过应用两种图形变换得到的。这与生成其他子类的 3 多面体[6], [13]类似。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

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

来源期刊

Discrete Mathematics 数学-数学

CiteScore

1.50

自引率

12.50%

发文量

424

审稿时长

6 months

期刊介绍： Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory. Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.

期刊最新文献

Extremal bounds for pattern avoidance in multidimensional 0-1 matrices Generation of 3-connected, planar line graphs A note on locating-dominating sets in twin-free graphs Light 3-faces in 3-polytopes without adjacent triangles Large matchings in maximal 1-planar graphs