Results 231 to 240 of about 29,288 (268)
Some of the next articles are maybe not open access.
SIAM Journal on Computing, 1992
The graph partitioning problem is the problem of dividing a given graph of \(n\) nodes into two sets of prescribed size while cutting a minimum number of edges. The authors show that the partitioning problem of a planar graph can be solved in polynomial time if the cutsize of the optimal partition is \(O(\log n)\) or if an embedding of the graph is ...
Thang Nguyen Bui, Andrew Peck
openaire +2 more sources
The graph partitioning problem is the problem of dividing a given graph of \(n\) nodes into two sets of prescribed size while cutting a minimum number of edges. The authors show that the partitioning problem of a planar graph can be solved in polynomial time if the cutsize of the optimal partition is \(O(\log n)\) or if an embedding of the graph is ...
Thang Nguyen Bui, Andrew Peck
openaire +2 more sources
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
Representations of Planar Graphs
SIAM Journal on Discrete Mathematics, 1993Summary: 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 +1 more
openaire +1 more source
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 +3 more sources
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, 2005zbMATH 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, 2005zbMATH 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, 2017zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daiqiang Hu +3 more
openaire +2 more sources
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
openaire +1 more source
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
openaire +1 more source
Planarity for clustered graphs
1995In 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 +2 more
openaire +1 more source