Results 131 to 140 of about 10,864 (212)
Minimal vertex Ramsey graphs and minimal forbidden subgraphs
Marta Borowiecka-Olszewska+2 more
openalex +1 more source
Selected Papers of the 31st International Workshop on Combinatorial Algorithms, IWOCA 2020. [PDF]
Gąsieniec L, Klasing R, Radzik T.
europepmc +1 more source
Forbidden subgraphs in generating graphs of finite groups
Andrea Lucchini, Daniele Nemmi
openalex +2 more sources
A Sharp Threshold Phenomenon in String Graphs. [PDF]
Tomon I.
europepmc +1 more source
Reconfiguration of vertex colouring and forbidden induced subgraphs
Manoj Belavadi+2 more
openalex +2 more sources
Photonic passbands induced by optical fractal effect in Cantor dielectric multilayers. [PDF]
Liu J, Shen J, Zhao D, Zhang P.
europepmc +1 more source
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
Getting new algorithmic results by extending distance-hereditary graphs via split composition. [PDF]
Cicerone S, Di Stefano G.
europepmc +1 more source
Forbidden Subgraphs of co-prime Graphs of finite Groups
V V Swathi, M S Sunitha
openalex +2 more sources
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