Another graph theory project

Stream: new members

[Martina Vergara]

Hello, my name is Martina Vergara. I'm taking the same course as @Iván Renison and I'm also trying to find something to formalize in graph theory. Specifically, I'm interested in formalizing a forbidden graph characterization. Some options I have in mind are:

• Characterization of derived graphs
• Characterization of split graphs (Theorem 6.3 in :eight_spoked_asterisk: )
• Characterization of n-colorable graphs
• Characterization of paw-free graphs
• Any other characterization in :eight_spoked_asterisk:

:eight_spoked_asterisk: Golumbic, M. C. (2004). Algorithmic graph theory and perfect graphs. Elsevier.

Which one do you think is more appropriate for a beginner? Thank you in advance!