類似資料

• Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification
  著者:: Eagling-Vose, Tala, 等
  出版事項: (2025)
• Steiner Forest for $H$-Subgraph-Free Graphs
  著者:: Eagling-Vose, Tala, 等
  出版事項: (2026)
• Finding $d$-Cuts in Probe $H$-Free Graphs
  著者:: Dabrowski, Konrad K., 等
  出版事項: (2025)
• Optimal b-Colourings and Fall Colourings in $H$-Free Graphs
  著者:: Ahn, Jungho, 等
  出版事項: (2026)
• Complexity Framework For Forbidden Subgraphs V: Beyond Simple Graphs
  著者:: Eagling-Vose, Tala, 等
  出版事項: (2025)