Standard DFS and BFS suffice to recognize and certify trivially perfect graphs, split graphs, bipartite chain graphs, and proper interval graphs using pattern-avoiding vertex orderings.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
On the power of standard DFS and BFS
Standard DFS and BFS suffice to recognize and certify trivially perfect graphs, split graphs, bipartite chain graphs, and proper interval graphs using pattern-avoiding vertex orderings.