Results 111 to 120 of about 10,864 (212)

Domination in graphoidally covered graphs: Least-kernel graphoidal graphs-II

AKCE International Journal of Graphs and Combinatorics, 2018
Given a graph , not necessarily finite, a graphoidal cover of means a collection of non-trivial paths in called -edges, which are not necessarily open (not necessarily finite), such that every vertex of is an internal vertex of at most one path in and ...
Purnima Gupta, Rajesh Singh
doaj   +1 more source

Triangle-free graphs and forbidden subgraphs

Discrete Applied Mathematics, 2002
AbstractThe relation of chromatic aspects and the existence of certain induced subgraphs of a triangle-free graph will be investigated. Based on a characterization statement of Pach, some results on the chromatic number of triangle-free graphs with certain forbidden induced subgraphs will be refined by describing their structure in terms of ...
openaire   +2 more sources

The maximum spectral radius of graphs of given size with forbidden subgraph [PDF]

, 2023
Xiaona Fang, Lihua You
openalex   +1 more source

Fermat Principle, Ramsey Theory and Metamaterials. [PDF]

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

Graph classes characterized both by forbidden subgraphs and degree sequences [PDF]

, 2007
Michael D. Barrus, Mohit Kumbhat, Stephen G. Hartke   +2 more
openalex   +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

Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs

, 2018
We discover new hereditary classes of graphs that are minimal (with respect to set inclusion) of unbounded clique-width. The new examples include split permutation graphs and bichain graphs.
Atminas, A., Brignall, R., Lozin, V., Stacho, J.   +3 more
core  

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

Clustering systems of phylogenetic networks. [PDF]

Theory Biosci, 2023
Hellmuth M, Schaller D, Stadler PF.
europepmc   +1 more source

Laboratory earthquakes decipher control and stability of rupture speeds. [PDF]

Nat Commun, 2023
Dong P, Xia K, Xu Y, Elsworth D, Ampuero JP.   +4 more
europepmc   +1 more source