Results 21 to 30 of about 391,866 (285)
Special Type Routing Problems in Plane Graphs
Mathematics, 2022 We considered routing problems for plane graphs to solve control problems of cutting machines in the industry. According to the cutting plan, we form its homeomorphic image in the form of a plane graph G.
Tatiana Makarovskikh, Anatoly Panyukov
doaj +1 more source
Cyclic Coloring of Plane Graphs with Maximum Face Size 16 and 17 [PDF]
, 2020 Plummer and Toft conjectured in 1987 that the vertices of every 3-connected plane graph with maximum face size D can be colored using at most D+2 colors in such a way that no face is incident with two vertices of the same color.
Dvorak, Zdenek +4 more
core +2 more sources
Enhanced boundary regularity of planar nonlocal minimal graphs and a butterfly effect
Bruno Pini Mathematical Analysis Seminar, 2020 In this note, we showcase some recent results obtained in [DSV19] concerning the stickiness properties of nonlocal minimal graphs in the plane. To start with, the nonlocal minimal graphs in the planeenjoy an enhanced boundary regularity, since boundary ...
Serena Dipierro +3 more
doaj +1 more source
Facial rainbow edge-coloring of simple 3-connected plane graphs [PDF]
Opuscula Mathematica, 2020 A facial rainbow edge-coloring of a plane graph \(G\) is an edge-coloring such that any two edges receive distinct colors if they lie on a common facial path of \(G\).
Július Czap
doaj +1 more source
A Penrose polynomial for embedded graphs [PDF]
, 2011 We extend the Penrose polynomial, originally defined only for plane graphs, to graphs embedded in arbitrary surfaces. Considering this Penrose polynomial of embedded graphs leads to new identities and relations for the Penrose polynomial which can not be
Aigner +22 more
core +4 more sources
Journal of Graph Algorithms and Applications, 2008 Summary: In this paper we give a simple algorithm to generate all connected rooted plane graphs with at most m edges. A ``rooted'' plane graph is a plane graph with one designated (directed) edge on the outer face. The algorithm uses \(O(m)\) space and generates such graphs in \(O(1)\) time per graph on average without duplications.
Yamanaka, Katsuhisa, Nakano, Shin-Ichi
openaire +1 more source
Structure of Projective Planar Subgraphs of the Graph Obstructions for Fixed Surface
Кібернетика та комп'ютерні технології, 2022 Consider the problem of studying the metric properties of a subgraph G \ v, where v is an arbitrary vertex of obstruction graphs G of a nonorientable genus, which will determine the sets of points of attachment of one subgraph to another and allow ...
Volodymyr Petrenjuk +2 more
doaj +1 more source
On Some Types of Matrices for Fan Plane Graph and Their Dual
Tikrit Journal of Pure Science, 2023 This work aims to discuss the adjacency matrices, Incidence matrix and Degree matrix of some types plane graphs we usually used them, as complete graphs, cycle graph,…,ect.
Haneen Mohammed Adil, Israa Munir Tawfik
doaj +1 more source
Bend-optimal orthogonal drawings of triconnected plane graphs
AKCE International Journal of Graphs and Combinatorics, 2018 A drawing of a plane graph G in which each edge is represented by a sequence of alternating horizontal and vertical line segments is called an orthogonal drawing.
Siddharth Bhatia, Kunal Lad, Rajiv Kumar
doaj +2 more sources
Bijections of plane Husimi graphs and certain combinatorial structures
European Journal of Mathematics and Applications, 2023 Plane Husimi graphs are combinatorial structures obtained when we replace edges in plane trees with complete graphs such that the resultant structures are connected and cycle-free.
Yvonne Wakuthii Kariuki +1 more
doaj