Results 141 to 150 of about 10,088 (246)
On 3-Coloring of ( 2 P 4 , C 5 )-Free Graphs. [PDF]
Jelínek V +4 more
europepmc +1 more source
On the chromatic number of a graph with two forbidden subgraphs
Medha Dhurandhar
openalex +1 more source
The largest subgraph without a forbidden induced subgraph
20 ...
Fox, Jacob +2 more
openaire +2 more sources
The forbidden subgraph characterization of directed vertex graphs
B. S. Panda
openalex +1 more source
Laboratory earthquakes decipher control and stability of rupture speeds. [PDF]
Dong P +4 more
europepmc +1 more source
Clustering systems of phylogenetic networks. [PDF]
Hellmuth M, Schaller D, Stadler PF.
europepmc +1 more source
Minimal vertex Ramsey graphs and minimal forbidden subgraphs
Marta Borowiecka-Olszewska +2 more
openalex +1 more source
Forbidden subgraphs in generating graphs of finite groups
Andrea Lucchini, Daniele Nemmi
openalex +2 more sources
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
Combinatorial Properties and Recognition of Unit Square Visibility Graphs. [PDF]
Casel K +4 more
europepmc +1 more source

