Pages that link to "Item:Q1933641"
From MaRDI portal
The following pages link to Polar permutation graphs are polynomial-time recognisable (Q1933641):
Displaying 7 items.
- Recognizing line-polar bipartite graphs in time \(O(n)\) (Q602675) (← links)
- Algorithms for unipolar and generalized split graphs (Q741738) (← links)
- Partitioning a graph into disjoint cliques and a triangle-free graph (Q2352776) (← links)
- Complexity and algorithms for recognizing polar and monopolar graphs (Q2437850) (← links)
- On opposition graphs, coalition graphs, and bipartite permutation graphs (Q2442203) (← links)
- Generalized Coloring of Permutations (Q5009614) (← links)
- Generalized coloring of permutations (Q6582372) (← links)