Tootfinder

Zahlen, bitte! Solomon W. Golomb und eine Oktillion IT-Systeme
Der Mathematiker Solomon W. Golomb schuf mit seiner Arbeit zu linear rückgekoppelten Schieberegistern die Basis, mit der heute unzählige IT-Systeme arbeiten.

Single conflict coloring, adaptable choosability and separation choosability
Carl Johan Casselgren, Kalle Eriksson
https://arxiv.org/abs/2509.13913 https://

Single conflict coloring, adaptable choosability and separation choosability
We study relations between three interrelated notions of graph (list) coloring: single conflict coloring, adapted list coloring and choosability with separation (with $1$ overlapping color between lists of adjacent vertices), and their respective invariants single conflict chromatic number $χ_{\nleftrightarrow}$, adaptable choosability $ch_{ad}$ and separation choosability $ch_{sep}$. We investigate graphs with small values of these invariants, and construct explicit families of graphs $G$ wit…

EDIT: See my follow-up reply framing why this may be a bad resource after all.
List of EAA penalties, authorities, and lawsuit risk by country is the useful (to me) section here:
https://equalizedigital.com/european-accessibility-ac…

The Ultimate Guide to the European Accessibility Act for WordPress - Equalize Digital
See what the European Accessibility Act means for your WordPress website and business. Laws and penalties for all 27 countries summarized.

"#RSS ist nicht tot, es riecht nur komisch." von @…: https://couchblog.de/blog/202…

Solange fließend Wasser im Haus, sogar warmes Wasser, Waschmaschine, Spülmaschine, Kühlschrank, moderne Konserven und überhaupt vorverarbeitete Nahrung, moderne Waschmittel etc genutzt werden, ist Tradwifing nur Cosplay…

🇺🇦 #NowPlaying on BBCRadio3's #EssentialClassics
Dmitry Shostakovich, Czech Philharmonic & Karel Ančerl:
🎵 Festive Overture, Op.96
#DmitryShostakovich #CzechPhilharmonic #KarelAnčerl

🇺🇦 Auf radioeins läuft...
Andreya Casablanca:
🎵 Talk About It
#NowPlaying #AndreyaCasablanca
https://andreyacasablanca.bandcamp.com/track/talk-about-it
https://open.spotify.com/track/4No5JekPpCEwyomn8q25k0

Voor wie BBC4 kan ontvangen...
Nu begonnen...
#Casablanca

Remarks on proper conflict-free degree-choosability of graphs with prescribed degeneracy
Masaki Kashima, Riste \v{S}krekovski, Rongxing Xu
https://arxiv.org/abs/2509.12560 https…

Remarks on proper conflict-free degree-choosability of graphs with prescribed degeneracy
A proper coloring $ϕ$ of $G$ is called a proper conflict-free coloring of $G$ if for every non-isolated vertex $v$ of $G$, there is a color $c$ such that $|ϕ^{-1}(c)\cap N_G(v)|=1$. As an analogy of degree-choosability of graphs, we introduced the notion of proper conflict-free $({\rm degree}+k)$-choosability of graphs. For a non-negative integer $k$, a graph $G$ is proper conflict-free $({\rm degree}+k)$-choosable if for any list assignment $L$ of $G$ with $|L(v)|\geq d_G…

Proper conflict-free degree-choosability of outerplanar graphs
Masaki Kashima, Riste \v{S}krekovski, Rongxing Xu
https://arxiv.org/abs/2509.06280 https://a…

Proper conflict-free degree-choosability of outerplanar graphs
A proper coloring $ϕ$ of $G$ is called a proper conflict-free coloring of $G$ if for every non-isolated vertex $v$ of $G$, there is a color $c$ such that $|ϕ^{-1}(c)\cap N_G(v)|=1$. As an analogy to degree-choosability of graphs, the authors recently, in a previous paper, introduced the notion of proper conflict-free $({\rm degree}+k)$-choosability of graphs. For a non-negative integer $k$, a graph $G$ is proper conflict-free $({\rm degree}+k)$-choosable if for any list assignment $…