Results 101 to 110 of about 332 (184)

DP-4-Colorability on Planar Graphs Excluding 7-Cycles Adjacent to 4- or 5-Cycles

Mathematics
In order to resolve Borodin’s Conjecture, DP-coloring was introduced in 2017 to extend the concept of list coloring. In previous works, it is proved that every planar graph without 7-cycles and butterflies is DP-4-colorable.
Fan Yang, Xiangwen Li, Ziwen Huang
doaj   +1 more source

Flips in colorful triangulations

Journal of Computational Geometry
The associahedron is the graph $\mathcal{G}_N$ that has as nodes all triangulations of a convex $N$-gon, and an edge between any two triangulations that differ in a flip operation.
Rohan Acharya, Torsten Mütze, Francesco Verciani   +2 more
doaj   +1 more source

Characterization and recognition of edge intersection graphs of 3-chromatic hypergraphs with multiplicity at most than two in the class of split graphs

Журнал Белорусского государственного университета: Математика, информатика, 2018
Let Lm(k) denote the class of edge intersection graphs of k-chromatic hypergraphs with multiplicity at most m. It is known that the problem of recognizing graphs from L1(k) is polynomially solvable if k = 2 and is NP-complete if k = 3.
Tatiana V. Lubasheva, Yury M. Metelsky
doaj  

Hybrid Optimization Algorithm Based on Double Particle Swarm in 3D NoC Mapping. [PDF]

Micromachines (Basel), 2023
Fang J, Cai H, Lv X.
europepmc   +1 more source

Does novel food differ in cultural contexts? A comparative analysis of Japanese and Singaporean cultural acceptance through text analysis of mass media. [PDF]

Curr Res Food Sci, 2023
Matsuoka H, Uchiyama Y, Woraitthinan K, Kohsaka R.   +3 more
europepmc   +1 more source

On 3-Coloring of ( 2 P 4 , C 5 )-Free Graphs. [PDF]

Algorithmica, 2022
Jelínek V, Klimošová T, Masařík T, Novotná J, Pokorná A.   +4 more
europepmc   +1 more source

Fermat Principle, Ramsey Theory and Metamaterials. [PDF]

Materials (Basel), 2023
Frenkel M, Shoval S, Bormashenko E.
europepmc   +1 more source

Characterization and recognition of edge intersection graphs of trichromatic hypergraphs with finite multiplicity in the class of split graphs

Informatika, 2018
A hypergraph is called k-chromatic if its vertex set can be partitioned into at most k pairwise disjoint subsets when each subset has no more than two common vertices with every edge of the hypergraph.
T. V. Lubasheva
doaj  

Connectivity Labeling in Faulty Colored Graphs. [PDF]

Distrib Comput
Petruschka A, Sapir S, Tzalik E.
europepmc   +1 more source

Forbidden subgraphs in terms of forbidden quantifiers.

Notre Dame Journal of Formal Logic, 1978
openaire   +4 more sources