Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing-Reference-Cited by-同舟云学术

Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing

Published:2012-06-26 Issue:1 Volume:72 Page:30-71
ISSN:0364-9024
Container-title:Journal of Graph Theory
language:en
Short-container-title:J. Graph Theory

Author:

Korzhik Vladimir P.¹,Mohar Bojan²

Affiliation:

1. NATIONAL UNIVERSITY OF CHERNIVTSI CHERNIVTSI UKRAINE AND INSTITUTE OF APPLIED PROBLEMS OF MECHANICS AND MATHEMATICS OF NATIONAL ACADEMY OF SCIENCE OF UKRAINE; LVIV; UKRAINE

2. DEPARTMENT OF MATHEMATICS; SIMON FRASER UNIVERSITY; BURNABY; B.C. V5A 1S6; CANADA

Publisher

Wiley

Subject

Geometry and Topology,Discrete Mathematics and Combinatorics

Reference15 articles.

1. Solution of Ringel's problem about vertex bound colouring of planar graphs and colouring of 1-planar graphs;Borodin;Metody Discret Anal,1984

2. A new proof of the 6-color theorem;Borodin;J Graph Theory,1995

3. Acyclic colouring of 1-planar graphs;Borodin;Discrete Anal Oper Res,1999

4. Bemerkungen zu einen Sechsfarbenproblem von G. Ringel;Bodendiek;Abh Math Semin Univ Hamburg,1983

5. Approximation algorithms for independent sets in map graphs;Chen;J Algorithms,2001

Cited by 82 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Weak-Dynamic Coloring of Graphs Beyond-Planarity;Graphs and Combinatorics;2023-12-23

2. Maximal 1-plane graphs with dominating vertices;Applied Mathematics and Computation;2023-11

3. 2-Layer k-Planar Graphs Density, Crossing Lemma, Relationships And Pathwidth;The Computer Journal;2023-04-21

4. Counting cliques in 1-planar graphs;European Journal of Combinatorics;2023-03

5. 1-planarity testing and embedding: An experimental study;Computational Geometry;2023-01