Results 41 to 50 of about 1,353,416 (150)

Convex Grid Drawings of Plane Graphs with Rectangular Contours

Journal of Graph Algorithms and Applications, 2008
In a convex drawing of a plane graph, all edges are drawn as straight-line segments without any edge-intersection and all facial cycles are drawn as convex polygons. In a convex grid drawing, all vertices are put on grid points.
Kazuyuki Miura, Akira Kamada, Takao Nishizeki   +2 more
doaj   +1 more source

Evaluating the rank generating function of a graphic 2-polymatroid [PDF]

, 2006
We consider the complexity of the two-variable rank generating function, $S$, of a graphic 2-polymatroid. For a graph $G$, $S$ is the generating function for the number of subsets of edges of $G$ having a particular size and incident with a particular ...
Noble, SD, Noble, Steven
core   +1 more source

On Uniquely 3-Colorable Plane Graphs without Adjacent Faces of Prescribed Degrees

Mathematics, 2019
A graph G is uniquely k-colorable if the chromatic number of G is k and G has only one k-coloring up to the permutation of the colors. For a plane graph G, two faces f 1 and f 2 of G are adjacent ( i , j )-faces if d ( f 1 ) = i,
Zepeng Li, Naoki Matsumoto, Enqiang Zhu, Jin Xu, Tommy Jensen   +4 more
doaj   +1 more source

Strong parity vertex coloring of plane graphs [PDF]

Discrete Mathematics & Theoretical Computer Science, 2014
A strong parity vertex coloring of a 2-connected plane graph is a coloring of the vertices such that every face is incident with zero or an odd number of vertices of each color.
Tomas Kaiser, Ondrej Rucky, Matej Stehlik, Riste Skrekovski   +3 more
doaj   +1 more source

The Toroidal Crossing Number [PDF]

, 2011
Studying the crossing number of the complete bipartite graph K4,n in ...
Ling, Tang, Shengxiang, Lv, Huang, Yuanqiu   +2 more
core   +1 more source

Facial graceful coloring of plane graphs [PDF]

Opuscula Mathematica
Let \(G\) be a plane graph. Two edges of \(G\) are facially adjacent if they are consecutive on the boundary walk of a face of \(G\). A facial edge coloring of \(G\) is an edge coloring such that any two facially adjacent edges receive different colors ...
Július Czap
doaj   +1 more source

Re-embedding a 1-Plane Graph into a Straight-Line Drawing in Linear Time

, 2016
Thomassen characterized some 1-plane embedding as the forbidden configuration such that a given 1-plane embedding of a graph is drawable in straight-lines if and only if it does not contain the configuration [C. Thomassen, Rectilinear drawings of graphs,
Seok-Hee Hong, Hong, Seok-Hee, Nagomachi, Hiroshi, Hiroshi Nagamochi   +3 more
core   +1 more source

Graph-based implicit knowledge discovery from architecture change logs [PDF]

, 2012
Service architectures continuously evolve as a consequence of frequent business and technical change cycles. Architecture change log data represents a source of evolution-centric information in terms of intent, scope and operationalisation to ...
Pooyan Jamshidi (5276344), Aakash, Ahmad, Aakash Ahmad, Ahmad, Aakash, Claus Pahl (12588787), Pahl, Claus, Muteer Arshad, Jamshidi, Pooyan, Pooyan Jamshidi, Arshad, Muteer, Claus Pahl, Muteer Arshad (12620287), Aakash Ahmad (5022314)   +12 more
core   +2 more sources

Total Semirelib Graph [PDF]

, 2013
In this paper, the concept of Total semirelib graph of a planar graph is introduced. Authors present a characterization of those graphs whose total semirelib graphs are planar, outer planar, Eulerian, hamiltonian with crossing number ...
Prasad, Manjunath, Venkanagouda M Goudar, Goudar, Venkanagouda, Manjunath Prasad K B   +3 more
core   +1 more source

Pragmatic Graph Rewriting Modifications [PDF]

, 1999
We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host graph, where nodes specified as 'Once Only' in the LHS of a rewrite match ...
Rodgers, Peter, Vidal, Natalia, P.J. Rodgers, N. Vidal   +3 more
core   +1 more source