Results 1 to 10 of about 441,789 (290)
On (p, 1)-Total Labelling of Some 1-Planar Graphs
Discussiones Mathematicae Graph Theory, 2021 A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that the (p, 1)-total labelling number (p ≥ 2) of every 1-planar graph G is at most Δ(G) + 2p − 2 provided that Δ (G) ≥
Niu Bei, Zhang Xin
doaj +2 more sources
Compact Drawings of 1-Planar Graphs with Right-Angle Crossings and Few Bends [PDF]
International Symposium Graph Drawing and Network Visualization, 2018 We study the following classes of beyond-planar graphs: 1-planar, IC-planar, and NIC-planar graphs. These are the graphs that admit a 1-planar, IC-planar, and NIC-planar drawing, respectively.
C Bachmaier +13 more
core +2 more sources
The structure and the list 3-dynamic coloring of outer-1-planar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 An outer-1-planar graph is a graph admitting a drawing in the plane so that all vertices appear in the outer region of the drawing and every edge crosses at most one other edge.
Yan Li, Xin Zhang
doaj +3 more sources
Non-1-Planarity of Lexicographic Products of Graphs
Discussiones Mathematicae Graph Theory, 2021 In this paper, we show the non-1-planarity of the lexicographic product of a theta graph and K2. This result completes the proof of the conjecture that a graph G ◦ K2 is 1-planar if and only if G has no edge belonging to two cycles.
Matsumoto Naoki, Suzuki Yusuke
doaj +2 more sources
Orthogonal and Smooth Orthogonal Layouts of 1-Planar Graphs with Low Edge Complexity [PDF]
International Symposium Graph Drawing and Network Visualization, 2018 While orthogonal drawings have a long history, smooth orthogonal drawings have been introduced only recently. So far, only planar drawings or drawings with an arbitrary number of crossings per edge have been studied. Recently, a lot of research effort in
Evmorfia N. Argyriou +7 more
openalex +2 more sources
The strong chromatic index of 1-planar graphs [PDF]
Discrete Mathematics & Theoretical Computer ScienceThe chromatic index $\chi'(G)$ of a graph $G$ is the smallest $k$ for which $G$ admits an edge $k$-coloring such that any two adjacent edges have distinct colors.
Yiqiao Wang +3 more
doaj +3 more sources
On An Extremal Problem In The Class Of Bipartite 1-Planar Graphs
Discussiones Mathematicae Graph Theory, 2016 A graph G = (V, E) is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study bipartite 1-planar graphs with prescribed numbers of vertices in partite sets.
Czap Július +2 more
doaj +2 more sources
From light edges to strong edge-colouring of 1-planar graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 A strong edge-colouring of an undirected graph $G$ is an edge-colouring where every two edges at distance at most~$2$ receive distinct colours. The strong chromatic index of $G$ is the least number of colours in a strong edge-colouring of $G$.
Julien Bensmail +3 more
doaj +2 more sources
Improvements on the density of maximal 1-planar graphs [PDF]
Journal of Graph Theory, 2015 A graph is 1‐planar if it can be drawn in the plane such that each edge is crossed at most once. A graph, together with a 1‐planar drawing is called 1‐plane.
János Barát, Gézá Tóth
openalex +3 more sources
Joins of 1-planar graphs [PDF]
Acta Mathematica Sinica. English series, 2014 A graph is called 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. In this paper, we study 1-planar graph joins. We prove that the join G + H is 1-planar if and only if the pair [G, H] is subgraph-majorized by one
Julius Czap +5 more
semanticscholar +3 more sources