Long cycles and spanning subgraphs of locally maximal 1‐planar graphs

Journal of Graph Theory, 2020 - Wiley Online Library
A graph is 1‐planar if it has a drawing in the plane such that each edge is crossed at most
once by another edge. Moreover, if this drawing has the additional property that for each …
被引用次数：17 相关文章

Long Cycles and Spanning Subgraphs of Locally Maximal 1-planar Graphs

I Fabrici, J Harant, T Madaras, S Mohr, R Soták… - arXiv e …, 2019 - ui.adsabs.harvard.edu
Abstract A graph is $1 $-planar if it has a drawing in the plane such that each edge is
crossed at most once by another edge. Moreover, if this drawing has the additional property …

Long Cycles and Spanning Subgraphs of Locally Maximal 1-planar Graphs

I Fabrici, J Harant, T Madaras, S Mohr, R Soták… - arXiv preprint arXiv …, 2019 - arxiv.org
A graph is $1 $-planar if it has a drawing in the plane such that each edge is crossed at most
once by another edge. Moreover, if this drawing has the additional property that for each …

Long cycles and spanning subgraphs of locally maximal 1‐planar graphs.

I Fabrici, J Harant, T Madaras, S Mohr… - Journal of Graph …, 2020 - search.ebscohost.com
A graph is 1‐planar if it has a drawing in the plane such that each edge is crossed at most
once by another edge. Moreover, if this drawing has the additional property that for each …

Long cycles and spanning subgraphs of locally maximal 1-planar graphs

I Fabrici, J Harant, T Madaras, S Mohr… - … OF GRAPH THEORY, 2020 - biblio.ugent.be
A graph is 1-planar if it has a drawing in the plane such that each edge is crossed at most
once by another edge. Moreover, if this drawing has the additional property that for each …