default search action
Journal of Combinatorial Theory, Series B, Volume 147
Volume 147, March 2021
- Luke Postle:
3-List-coloring graphs of girth at least five on surfaces. 1-36 - Raimundo Briceño, Andrei Bulatov, Víctor Dalmau, Benoît Larose:
Dismantlability, connectedness, and mixing in relational structures. 37-70 - Yan-Li Qin, Binzhou Xia, Jin-Xin Zhou, Sanming Zhou:
Stability of graph pairs. 71-95 - Gennian Ge, Chong Shangguan:
Sparse hypergraphs: New bounds and constructions. 96-132
- Carl Feghali:
Reconfiguring colorings of graphs with bounded maximum average degree. 133-138
- Bogdan Alecu, Aistis Atminas, Vadim V. Lozin:
Graph functionality. 139-158 - Binzhou Xia:
Tetravalent half-arc-transitive graphs with unbounded nonabelian vertex stabilizers. 159-182 - Jakub Przybylo:
The 1-2-3 Conjecture almost holds for regular graphs. 183-200 - Natasha Morrison, Alexander Roberts, Alex D. Scott:
Maximising the number of cycles in graphs with forbidden subgraphs. 201-237 - Ararat Harutyunyan, Lucas Pastor, Stéphan Thomassé:
Disproving the normal graph conjecture. 238-251 - Martin Dolezal, Jan Grebík, Jan Hladký, Israel Rocha, Václav Rozhon:
Relating the cut distance and the weak* topology for graphons. 252-298 - Yan Cao, Guantao Chen:
On the average degree of edge chromatic critical graphs. 299-338
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.