Note: The references are not ordered alphabetically!
1800 
P. Erdos Some combinatorial, geometric and set theoretic problems in measure theory in Kölzow, D.; MaharamStone, D. (eds.), Measure Theory Oberwolfach, Lecture Notes in Mathematics 1089 (1983) 
1801 
T. Calamoneri, B. Sinaimeri Relating threshold tolerance graphs to other graph classes In Proc. of the 15th Italian Conference on Theoretical Computer Science ICTCS (2014) Available here. 
1802 
P.A. Golovach, P. Heggernes, N. Lindzey, R.M. McConnell, V. Fernandes dos Santos, J.P. Sprinrad, J.L. Szwarcfiter On recognition of threshold tolerance graphs and their complements Discrete Appl. Math. 216 No. 171180 (2017) doi 10.1016/j.dam.2015.01.034 
1803 
V. Dujmovic, A. Por, D.R. Wood Track layouts of graphs DMTCS 6 No.2 497522 (2004) 
1804 
M.D. Safe Characterization and lineartime detection of minimal obstructions to concaveround graphs and the circularones property J. Graph. Th. 93 No.2 268298 (2020) 
1805 
V. Lozin, V. Zamaraev The structure and the number of $P_7$free bipartite graphs European J. Combin 65 142153 (2017) doi 10.1016/j.ejc.2017.05.008 
1806 
M. Jiang Recognizing dinterval graphs and dtrack interval graphs Algorithmica 66 541563 (2012) doi 10.1007/s0045301296515 
1807 
B.M.P. Jansen, V. Raman, M. Vatshelle Parameter ecology for feedback vertex set Tsinghua science and technology 19 No.4 387409 (2014) 
1808 

1809 
F. Maffray Fast recognition of doubled graphs Theoretical Comp.Sci. 516 96100 (2014 doi 10.1016/j.tcs.2013.11.020 
1810 
A. Munaro On line graphs of subcubic trianglefree graphs Discrete Math. 340 No.6 12101226 (2017) doi 10.1016/j.disc.2017.01.006 
1811 
A. Munaro Bounded clique cover of some sparse graphs Discrete Math. 340 No.9 22082216 (2017) doi 10.1016/j.disc.2017.04.004 
1812 
Z. Deniz, E. Galby, A. Munaro, B. Ries On contact graphs of paths on a grid Proc. of Graph Drawing 2018, LNCS 11282 317330 (2018) 
1813 
E. Gioan, Ch. Paul, M. Tedder5, D. Corneil Practical and Efficient Circle Graph Recognition Algoritmica 69 No.4 759788 (2014) 
1814 
S. Chaplick Intersection graphs of noncrossing paths Proceedings of the International Workshop on GraphTheoretic Concepts in Computer Science WG 2019, LNCS 11789 (2019) doi 10.1007/9783030307868_24 Available on arXiv. 
1815 
R. Adhikary, K. Bose, S. Mukherjee, B. Roy Complexity of maximum cut on interval graphs Proc. of 37th International Symposium on Computation Geometry 7:17:11 (2021) 
1816 
O. Cagirici, P. Hlineny, B. Roy On colourability of polygon visibility graphs 37th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science 21:121:14 (2018) 
1817  Let $k$ be the size of a maximum independent set in $G$. For every set $S$ in $V(G)$ with $k$ vertices, we can check in linear time whether $G[S]$ is independent and $G\S$ is $P_3$free. This gives an $O(V(G)^k)$ algorithm to decide whether $G$ is monopolar. (P. Ochem) 
1818 
O. Aichholzer, W. Mulzer, P. Schnider, B. Vogtenhuber NPCompleteness of MaxCut for Segment Intersection Graphs In: 34th European Workshop on Computational Geometry, Berlin, Germany, March 21–23, 2018 Available here. 
1819 
J.E. Williamson On Hamiltonconnected graphs Ph.D.Thesis, Western Michigan University 1973 
1820 
O. Ore Hamilton connected graphs Journal de Mathematiques Pures et Appliquees XLII 2127 (1963) 
1821 
P. Seymour How the proof of the Strong Perfect Graph Conjecture was found 2006 Available here 