.
Natural bijections between directed and undirected self-complementary graphs
Noncrossing trees and noncrossing graphs.
Note on enumeration of labeled split graphs
The paper brings explicit formula for enumeration of vertex-labeled split graphs with given number of vertices. The authors derive this formula combinatorially using an auxiliary assertion concerning number of split graphs with given clique number. In conclusion authors discuss enumeration of vertex-labeled bipartite graphs, i.e., a graphical class defined in a similar manner to the class of split graphs.
Note on Turán's graph