Results 261 to 270 of about 757,662 (296)
Journal of Combinatorial Theory Series B, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Angelika Steger, Colin J. H. McDiarmid
exaly +6 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
IEEE Transactions on Fuzzy Systems, 2015
Fuzzy planar graph is a very important subclass of fuzzy graph. In this paper, two types of edges are mentioned for fuzzy graphs: effective edges and considerable edges. In addition, a comparative study between Kuratowski's graphs and fuzzy planar graph is made. A new concept of a strong fuzzy planar graph is introduced.
Sovan Samanta, Madhumangal Pal
exaly +3 more sources
Fuzzy planar graph is a very important subclass of fuzzy graph. In this paper, two types of edges are mentioned for fuzzy graphs: effective edges and considerable edges. In addition, a comparative study between Kuratowski's graphs and fuzzy planar graph is made. A new concept of a strong fuzzy planar graph is introduced.
Sovan Samanta, Madhumangal Pal
exaly +3 more sources
Representations of Planar Graphs
SIAM Journal on Discrete Mathematics, 1993This 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 right angles ...
Graham R. Brightwell +1 more
openaire +1 more source
Planarity and Hyperbolicity in Graphs
Graphs and Combinatorics, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Walter Carballosa +3 more
openaire +1 more source
SIAM Journal on Computing, 1992
A common problem in graph theory is that of dividing the vertices of a graph into two sets of prescribed size while cutting a minimum number of edges. In this paper this problem is considered as it is restricted to the class of planar graphs. Let G be a planar graph on n vertices and $s \in [0,n]$ be given.
Thang Nguyen Bui, Andrew Peck
openaire +3 more sources
A common problem in graph theory is that of dividing the vertices of a graph into two sets of prescribed size while cutting a minimum number of edges. In this paper this problem is considered as it is restricted to the class of planar graphs. Let G be a planar graph on n vertices and $s \in [0,n]$ be given.
Thang Nguyen Bui, Andrew Peck
openaire +3 more sources
Algorithmica, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Till Bruckdorfer +2 more
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Till Bruckdorfer +2 more
openaire +1 more source
Graphs and Combinatorics, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Euler, Reinhardt, Zamfirescu, Tudor
openaire +5 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Euler, Reinhardt, Zamfirescu, Tudor
openaire +5 more sources
Drawing Planar Graphs Symmetrically, III: Oneconnected Planar Graphs
Algorithmica, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seok-Hee Hong 0001, Peter Eades
openaire +3 more sources
On the Equitable Edge-Coloring of 1-Planar Graphs and Planar Graphs
Graphs and Combinatorics, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daiqiang Hu +3 more
openaire +3 more sources
Drawing Planar Graphs Symmetrically, II: Biconnected Planar Graphs
Algorithmica, 2005zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Seok-Hee Hong 0001, Peter Eades
openaire +1 more source