Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Planar and Non Planar Construction of - Uniquely Colorable Graph
View through CrossRef
A uniquely colorable graph G whose chromatic partition contains atleast one g - set is termed as a g - uniquely colorable graph. In this paper, we provide necessary and sufficient condition for and G* to be g - uniquely colorable whenever G g- uniquely colorable and also provide constructive characterization to show that whenever G is g- uniquely colorable such that |P | ³ 2, G can be both planarand non planar.
Science Publishing Corporation
Title: Planar and Non Planar Construction of - Uniquely Colorable Graph
Description:
A uniquely colorable graph G whose chromatic partition contains atleast one g - set is termed as a g - uniquely colorable graph.
In this paper, we provide necessary and sufficient condition for and G* to be g - uniquely colorable whenever G g- uniquely colorable and also provide constructive characterization to show that whenever G is g- uniquely colorable such that |P | ³ 2, G can be both planarand non planar.
.
Related Results
Planar graphs without adjacent cycles of prescribed lengths are 3-colorable∗
Planar graphs without adjacent cycles of prescribed lengths are 3-colorable∗
About Steinberg’s conjecture and Erd˝os’s open question on the 3coloring in planar graphs, it is left the following challenging question: whether every planar graph without cycles ...
Oriented paths in digraphs and the S-packing coloring of subcubic graph
Oriented paths in digraphs and the S-packing coloring of subcubic graph
Chemins orientés dans les graphes orientés et coloration S-packing des graphes subcubiques
Cette thèse de doctorat est divisée en deux parties principales: La parti...
Graph convolutional neural networks for 3D data analysis
Graph convolutional neural networks for 3D data analysis
(English) Deep Learning allows the extraction of complex features directly from raw input data, eliminating the need for hand-crafted features from the classical Machine Learning p...
Bilangan Terhubung Titik Pelangi pada Graf Garis dan Graf Tengah dari Hasil Operasi Comb Graf Bintang C<sub>3</sub> dan Graf Bintang S<sub>n</sub>
Bilangan Terhubung Titik Pelangi pada Graf Garis dan Graf Tengah dari Hasil Operasi Comb Graf Bintang C<sub>3</sub> dan Graf Bintang S<sub>n</sub>
Penelitian ini bertujuan menentukan bilangan terhubung titik pelangi (rainbow vertex connection number) pada graf garis dan graf tengah yang diperoleh dari hasil operasi comb antar...
Facial entire coloring of 4-minor-free graphs
Facial entire coloring of 4-minor-free graphs
<p>Let <span class="math inline">\(G\)</span> be a plane graph. If two edges are adjacent and consecutive on the boundary walk of a face of <span class="math i...
Circular choosability via combinatorial Nullstellensatz
Circular choosability via combinatorial Nullstellensatz
AbstractA p‐list assignment L of a graph G assigns to each vertex v of G a set ${{L}}({{v}})\subseteq \{{{0}}{{,}} {{1}}{{,}}\ldots{{,}}\, {{p}}-{{1}}\}$ of permissible colors. We ...
Bootstrapping a Biodiversity Knowledge Graph
Bootstrapping a Biodiversity Knowledge Graph
The "biodiversity knowledge graph" is a nice metaphor for connecting biodiversity data sources, but can we actually build it? Do we have sufficient linked data available? Given tha...
Embedding area of d‐way shuffle graph on a VLSI model
Embedding area of d‐way shuffle graph on a VLSI model
AbstractAn important problem in the design of a VLSI chip is that of determining how much area is taken to embed a graph G into a planar grid when the VLSI chip is modeled using a ...