The maximum signless Laplacian spectral radius of graphs with forbidden subgraphs
Dandan Chen, Xiaoling Ma
openalex +2 more sources
Laboratory earthquakes decipher control and stability of rupture speeds. [PDF]
Dong P +4 more
europepmc +1 more source
Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs [PDF]
Maria Axenovich +2 more
openalex +1 more source
Local certification of forbidden subgraphs
Detecting specific structures in a network has been a very active theme of research in distributed computing for at least a decade. In this paper, we start the study of subgraph detection from the perspective of local certification. Remember that a local certification is a distributed mechanism enabling the nodes of a network to check the correctness ...
Bousquet, Nicolas +4 more
openaire +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
Clustering systems of phylogenetic networks. [PDF]
Hellmuth M, Schaller D, Stadler PF.
europepmc +1 more source
Combinatorial Properties and Recognition of Unit Square Visibility Graphs. [PDF]
Casel K +4 more
europepmc +1 more source
Forbidden rainbow subgraphs that force large monochromatic or multicolored k-connected subgraphs [PDF]
Xihe Li, Ligong Wang
openalex +1 more source
Automated design of dynamic programming schemes for RNA folding with pseudoknots. [PDF]
Marchand B +4 more
europepmc +1 more source
A characterization of graph properties testable for general planar graphs with one-sided error (It is all about forbidden subgraphs) [PDF]
Artur Czumaj, Christian Sohler
openalex +1 more source

