Results 91 to 100 of about 312 (179)
Forbidden subgraphs of coloring graphs
Involve, a Journal of Mathematics, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alvarado, Francisco +3 more
openaire +3 more sources
Disjoint stars and forbidden subgraphs
Hiroshima Mathematical Journal, 2006 Let $r,k$ be integers with $r\ge 3, k\ge 2$. We prove that if $G$ is a $K_{1,r}$-free graph of order at least $(k-1)(2r-1)+1$ with $\delta(G)\ge 2$, then $G$ contains $k$ vertex-disjoint copies of $K_{1,2}$. This result is motivated by the problem of characterizing a forbidden subgraph $H$ which satisfies the statement "every $H$-free graph of ...
openaire +2 more sources
DP-4-Colorability on Planar Graphs Excluding 7-Cycles Adjacent to 4- or 5-Cycles
MathematicsIn 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
Журнал Белорусского государственного университета: Математика, информатика, 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
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 +3 more
europepmc +1 more source
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
3-Colourability and Forbidden Subgraphs
Electronic Notes in Discrete Mathematics, 2000 Abstract In this paper we investigate the chromatic aspects for graphs with forbidden induced subgraphs with emphasis on the question of 3-colourability. In the main part all possible pairs (A, B) of forbidden induced subgraphs, s.t. every A- and B -free graph is 3-colourable, are determined.
openaire +1 more source
On 3-Coloring of ( 2 P 4 , C 5 )-Free Graphs. [PDF]
Algorithmica, 2022 Jelínek V +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