Let $G$ be a graph s.t. any two cycles $C_1, C_2 \subseteq G$ either have a common vertex or $G$ has an edge joining a vertex in $C_1$ to a vertex of $C_2$. Equivalently: for every cycle $C$ the graph obtained from $G$ by deleting $C$ and all neighbors of $C$ is acyclic. Let's denote the class of...
In "Graph theory as I have known it", p.12, Knights Errant, the late Tutte mentions as an aside the chess question "Does either Black or White have a certain win from the initial position, given perfect play by both sides". Is there any literature on that possibility of a black win, that is the ...
In "Graph theory as I have known it", p.12, Knights Errant, the late Tutte mentions as an aside the chess question "Does either Black or White have a certain win from the initial position, given perfect play by both sides". Is there any literature on that possibility of a black win, that is the ...
I was looking for tag wikis to edit (on meta), so I went to the last page, where I'll often tags without any description. I see the ux tag, which people may not realize means user experience. I click on it and I see that I am editing the user experience wiki, which defeats the point of what I wan...
I've found that the hover for a synonym of a tag, not only doesn't tell you that it's a synonym directly (though seeing no quantity for it clues you in), but it also has a synonyms link. The original tag doesn't have the synonyms link. I now know that that will tell me if it's synonymed (for wh...
« first day (2621 days earlier) ← previous day next day → last day (1289 days later) »