Note on Min-k-Planar Drawings of Graphs

被引：0

作者：

Masaryk University, Brno, Czech Republic ^{[1
]}

不详 ^{[2
]}

机构：

来源：

Leibniz Int. Proc. Informatics, LIPIcs | 1868年

关键词：

Compendex;

D O I：

32nd International Symposium on Graph Drawing and Network Visualization, GD 2024

中图分类号：

学科分类号：

摘要：

Graph theory

引用

共 30 条

[11] Complexity of paired domination in AT-free and planar graphs
Tripathi, Vikash
Kloks, Ton
Pandey, Arti
Paul, Kaustav
Wang, Hung-Lung
arXiv, 2021,
[12] Strong k-colourings of graphs
Zverovich, I.E.
Discrete Math Appl, 1600, 1 (83-94): : 83 - 94
[13] On (k, λ)-magically total labeling of graphs
Bing, Y.A.O.
Chen, XianG'En
Ming, Y.A.O.
Cheng, Hui
Journal of Combinatorial Mathematics and Combinatorial Computing, 2013, 87 : 237 - 253
[14] Planar graphs with the maximum number of induced 6-cycles
Savery, Michael
arXiv, 2021,
[15] Approximate Distance Oracles for Planar Graphs with Subpolynomial Error Dependency
Le, Hung
arXiv, 2022,
[16] Total coloring of planar graphs without 6-cycles
Center for Discrete Mathematics, Fuzhou University, Fuzhou 350002, China
不详
Discrete Appl Math, 1600, 2-3 (157-163):
[17] On the integer {k}-domination number of circulant graphs
Department of Mathematics, National Taiwan Normal University, Taipei
11677, Taiwan
不详
30010, Taiwan
不详
DE
19716, United States
arXiv,
[18] Independence polynomials of k-tree related graphs
Department of Mathematics, University of Mississippi, University, MS 38677, United States
Discrete Appl Math, 8 (943-950):
[19] From Directed Steiner Tree to Directed Polymatroid Steiner Tree in Planar Graphs
Chekuri, Chandra
Jain, Rhea
Kulkarni, Shubhang
Zheng, Da Wei
Zhu, Weihao
Leibniz International Proceedings in Informatics, LIPIcs, 308
[20] Exploration of k-edge-deficient temporal graphs
Erlebach, Thomas
Spooner, Jakob T.
ACTA INFORMATICA, 2022, 59 (04) : 387 - 407

← 1 2 3 →