Results 31 to 40 of about 2,427,282 (299)
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
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
Facial graceful coloring of plane graphs [PDF]
Opuscula MathematicaLet \(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
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
Facial [r,s,t]-Colorings of Plane Graphs
Discussiones Mathematicae Graph Theory, 2019 Let G be a plane graph. Two edges are facially adjacent in G if they are consecutive edges on the boundary walk of a face of G. Given nonnegative integers r, s, and t, a facial [r, s, t]-coloring of a plane graph G = (V,E) is a mapping f : V ∪ E → {1, . .
Czap Július +3 more
doaj +1 more source
Even cycles and perfect matchings in claw-free plane graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2020 Lov{\'a}sz showed that a matching covered graph $G$ has an ear decomposition starting with an arbitrary edge of $G$. Let $G$ be a graph which has a perfect matching.
Shanshan Zhang +2 more
doaj +1 more source
On the dimension of Archimedean solids [PDF]
Opuscula Mathematica, 2014 We study the dimension of graphs of the Archimedean solids. For most of these graphs we find the exact value of their dimension by finding unit-distance embeddings in the euclidean plane or by proving that such an embedding is not possible.
Tomáš Madaras, Pavol Široczki
doaj +1 more source
On partitioning the edges of 1-plane graphs [PDF]
Theoretical Computer Science, 2015 A 1-plane graph is a graph embedded in the plane such that each edge is crossed at most once. A 1-plane graph is optimal if it has maximum edge density.
W. Lenhart, G. Liotta, F. Montecchiani
semanticscholar +1 more source