Results 161 to 170 of about 1,011,259 (278)

The maximum number of edges of bipartite 1-planar graphs with 1-disk drawings

open access: yesAKCE International Journal of Graphs and Combinatorics
A graph is 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. Let G be a bipartite 1-planar graph with bipartition sets X and Y. A 1-disk [Formula: see text] drawing of G is a 1-planar drawing such that all vertices
Guiping Wang
doaj   +1 more source

A NOTE ON ALMOST BALANCED BIPARTITIONS OF A GRAPH [PDF]

open access: diamond, 2014
Xiaolan Hu, Yunqing Zhang, Yaojun Chen
openalex   +1 more source

Kempe equivalence of almost bipartite graphs [PDF]

open access: green, 2022
Akihiro Higashitani, Naoki Matsumoto
openalex   +1 more source

Home - About - Disclaimer - Privacy