Results 31 to 40 of about 82,884 (244)
Graph polynomials and paintability of plane graphs
Discrete Applied Mathematics, 2022 There exists a variety of coloring problems for plane graphs, involving vertices, edges, and faces in all possible combinations. For instance, in the \emph{entire coloring} of a plane graph we are to color these three sets so that any pair of adjacent or incident elements get different colors.
Jarosław Grytczuk +2 more
openaire +2 more sources
Decompositions of Plane Graphs Under Parity Constrains Given by Faces
Discussiones Mathematicae Graph Theory, 2013 An edge coloring of a plane graph G is facially proper if no two faceadjacent edges of G receive the same color. A facial (facially proper) parity edge coloring of a plane graph G is an (facially proper) edge coloring with the property that, for each ...
Czap Július, Tuza Zsolt
doaj +1 more source
Construction of a user-friendly software-defined networking management using a graph-based abstraction layer [PDF]
PeerJ Computer ScienceThe software-defined networking (SDN) paradigm relies on the decoupling of the control plane and data plane. Northbound interfaces enable the implementation of network services through logical centralised control.
Yufeng Jia +5 more
doaj +2 more sources
Aequationes Mathematicae, 1975 The orthogonality relation among subspaces of a finite vector space is studied here by means of the corresponding graph. In the case we consider, this graph has some highly symmetric induced subgraphs. We find three infinite families of graphs of girth 3, and two infinite families of graphs of girth 5, whose automorphism groups are transitive on ...
openaire +2 more sources
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 +4 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
ROBUST AND ACCURATE PLANE SEGMENTATION FROM POINT CLOUDS OF STRUCTURED SCENES [PDF]
ISPRS Annals of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2020 Plane segmentation from the point cloud is an important step in various types of geo-information related to human activities. In this paper, we present a new approach to accurate segment planar primitives simultaneously by transforming it into the best ...
P. Hu, Y. Liu, M. Tian, M. Hou
doaj +1 more source
Spanning Plane Subgraphs of 1‐Plane Graphs
Journal of Graph TheoryABSTRACTA graph drawn on the plane is called 1‐plane if each edge is crossed at most once by another edge. In this paper, we show that every 4‐edge‐connected 1‐plane graph has a connected spanning plane subgraph. We also show that there exist infinitely many 4‐connected 1‐plane graphs that have no 2‐connected spanning plane subgraphs.
Kenta Noguchi +2 more
openaire +2 more sources
Crosstalk between the ribosome quality control‐associated E3 ubiquitin ligases LTN1 and RNF10
FEBS Letters, EarlyView.Loss of the E3 ligase LTN1, the ubiquitin‐like modifier UFM1, or the deubiquitinating enzyme UFSP2 disrupts endoplasmic reticulum–ribosome quality control (ER‐RQC), a pathway that removes stalled ribosomes and faulty proteins. This disruption may trigger a compensatory response to ER‐RQC defects, including increased expression of the E3 ligase RNF10 ...
Yuxi Huang +8 more
wiley +1 more source
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