Földes y Hammer (1977a) had a more general definition, in which the graphs they called split graphs also included bipartite graphs (that is, graphs that be partitioned into two independent sets) and the complements of bipartite graphs (that is, graphs that can be partitioned into two cliques).Földes y Hammer (1977b) use the definition given here, which has been followed in the subsequent literature; for instance, it is Brandstädt, Le y Spinrad (1999), Definition 3.2.3, p.41. Földes, Stéphane; Hammer, Peter Ladislaw (1977a), «Split graphs», Proceedings of the Eighth Southeastern Conference on Combinatorics, Graph Theory and Computing (Louisiana State Univ., Baton Rouge, La., 1977), Congressus Numerantium XIX, Winnipeg: Utilitas Math., pp. 311-315, MR0505860.. Földes, Stéphane; Hammer, Peter Ladislaw (1977b), «Split graphs having Dilworth number two», Canadian Journal of Mathematics29 (3): 666-672, MR0463041, doi:10.4153/CJM-1977-069-1.. Brandstädt, Andreas; Le, Van Bang; Spinrad, Jeremy (1999), Graph Classes: A Survey, SIAM Monographs on Discrete Mathematics and Applications, ISBN0-89871-432-X, (requiere registro)..
Földes y Hammer (1977a) had a more general definition, in which the graphs they called split graphs also included bipartite graphs (that is, graphs that be partitioned into two independent sets) and the complements of bipartite graphs (that is, graphs that can be partitioned into two cliques).Földes y Hammer (1977b) use the definition given here, which has been followed in the subsequent literature; for instance, it is Brandstädt, Le y Spinrad (1999), Definition 3.2.3, p.41. Földes, Stéphane; Hammer, Peter Ladislaw (1977a), «Split graphs», Proceedings of the Eighth Southeastern Conference on Combinatorics, Graph Theory and Computing (Louisiana State Univ., Baton Rouge, La., 1977), Congressus Numerantium XIX, Winnipeg: Utilitas Math., pp. 311-315, MR0505860.. Földes, Stéphane; Hammer, Peter Ladislaw (1977b), «Split graphs having Dilworth number two», Canadian Journal of Mathematics29 (3): 666-672, MR0463041, doi:10.4153/CJM-1977-069-1.. Brandstädt, Andreas; Le, Van Bang; Spinrad, Jeremy (1999), Graph Classes: A Survey, SIAM Monographs on Discrete Mathematics and Applications, ISBN0-89871-432-X, (requiere registro)..
Földes y Hammer (1977a) had a more general definition, in which the graphs they called split graphs also included bipartite graphs (that is, graphs that be partitioned into two independent sets) and the complements of bipartite graphs (that is, graphs that can be partitioned into two cliques).Földes y Hammer (1977b) use the definition given here, which has been followed in the subsequent literature; for instance, it is Brandstädt, Le y Spinrad (1999), Definition 3.2.3, p.41. Földes, Stéphane; Hammer, Peter Ladislaw (1977a), «Split graphs», Proceedings of the Eighth Southeastern Conference on Combinatorics, Graph Theory and Computing (Louisiana State Univ., Baton Rouge, La., 1977), Congressus Numerantium XIX, Winnipeg: Utilitas Math., pp. 311-315, MR0505860.. Földes, Stéphane; Hammer, Peter Ladislaw (1977b), «Split graphs having Dilworth number two», Canadian Journal of Mathematics29 (3): 666-672, MR0463041, doi:10.4153/CJM-1977-069-1.. Brandstädt, Andreas; Le, Van Bang; Spinrad, Jeremy (1999), Graph Classes: A Survey, SIAM Monographs on Discrete Mathematics and Applications, ISBN0-89871-432-X, (requiere registro)..