Results 231 to 240 of about 18,159 (263)

Planarity and Hyperbolicity in Graphs

Graphs and Combinatorics, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Walter Carballosa, Ana Portilla, José M. Rodríguez 0001, José María Sigarreta   +3 more
openaire   +1 more source

Representations of Planar Graphs

SIAM Journal on Discrete Mathematics, 1993
Summary: This paper shows that every 3-connected planar graph \(G\) can be represented as a collection of circles, one circle representing each vertex and each face, so that, for each edge of \(G\), the four circles representing the two endpoints and the two neighboring faces meet at a point, and furthermore the vertex-circles cross the face-circles at
Graham R. Brightwell, Edward R. Scheinerman   +1 more
openaire   +1 more source

Planar Bus Graphs

Algorithmica, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Till Bruckdorfer, Stefan Felsner, Michael Kaufmann 0001   +2 more
openaire   +1 more source

On Planar Toeplitz Graphs

Graphs and Combinatorics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Euler, Reinhardt, Zamfirescu, Tudor
openaire   +3 more sources

Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs

Algorithmica, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seok-Hee Hong 0001, Peter Eades
openaire   +2 more sources

Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs

Algorithmica, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seok-Hee Hong 0001, Peter Eades
openaire   +1 more source

On the Equitable Edge-Coloring of 1-Planar Graphs and Planar Graphs

Graphs and Combinatorics, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daiqiang Hu, Jian-Liang Wu 0001, Donglei Yang, Xin Zhang 0017   +3 more
openaire   +2 more sources

Planarity for clustered graphs

1995
In this paper, we introduce a new graph model known as clustered graphs, i.e. graphs with recursive clustering structures. This graph model has many applications in informational and mathematical sciences. In particular, we study C-planarity of clustered graphs.
Qing-Wen Feng, Robert F. Cohen, Peter Eades   +2 more
openaire   +1 more source

Generalizations of planar graphs

Networks, 1982
AbstractTwo new generalizations of planar graphs, called quasiplanar and pseudoplanar graphs, are introduced and discussed. It is shown that planar graphs are quasiplanar and these in turn are pseudoplanar. Conversely, a pseudoplanar graph that contains with each arc its reverse arc is quasiplanar.
openaire   +1 more source

Formalization of planar graphs

1995
Among many fields of mathematics and computer science, discrete mathematics is one of the most difficult fields to formalize because we prove theorems using intuitive inferences that have not been rigorously formalized yet. This paper focuses on graph theory from discrete mathematics and formalizes planar graphs.
Mitsuharu Yamamoto, Shin-ya Nishizaki, Masami Hagiya, Yozo Toda   +3 more
openaire   +1 more source