Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,General Mathematics
Reference16 articles.
1. Asano, K.: The crossing number of K 1,3,n and K 2,3,n. , J. Graph Theory, 10, 1–8 (1986)
2. Bondy, J. A., Murty, U. S. R.: Graph Theory, Springer-Verlag, New York, GTM 244, 2008
3. Borodin, O. V.: Solution of Ringel’s problems on the vertex-face coloring of plane graphs and on the coloring of 1-planar graphs (in Russian). Diskret. Analiz, 41, 12–26 (1984)
4. Borodin, O. V.: A new proof of the six color theorem. J. Graph Theory, 19(4), 507–521 (1995)
5. Czap, J., Hudák, D.: 1-planarity of compete multipartite graphs. Discrete Appl. Math., 160, 505–512 (2012)
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Strong Edge Coloring of Outerplane Graphs with Independent Crossings;Acta Mathematicae Applicatae Sinica, English Series;2024-03-27
2. Weak-Dynamic Coloring of Graphs Beyond-Planarity;Graphs and Combinatorics;2023-12-23
3. Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions;Journal of Discrete Mathematical Sciences and Cryptography;2021-08-18
4. On (p, 1)-Total Labelling of NIC-Planar Graphs;Bulletin of the Malaysian Mathematical Sciences Society;2021-07-15
5. On the Sizes of Bipartite 1-Planar Graphs;The Electronic Journal of Combinatorics;2021-05-21