Pages that link to "Item:Q5937917"
From MaRDI portal
The following pages link to Efficient algorithms for graphs with few \(P_4\)'s (Q5937917):
Displayed 5 items.
- Constructing a minimum height elimination tree of a tree in linear time (Q881880) (← links)
- \(b\)-coloring of tight graphs (Q1759847) (← links)
- The clique operator on cographs and serial graphs (Q1827743) (← links)
- The clique operator on graphs with few \(P_{4}\)'s (Q2489945) (← links)
- Restricted coloring problems on graphs with few (Q2840684) (← links)