Pages that link to "Item:Q1827743"
From MaRDI portal
The following pages link to The clique operator on cographs and serial graphs (Q1827743):
Displayed 16 items.
- Split clique graph complexity (Q393107) (← links)
- On the termination of some biclique operators on multipartite graphs (Q496448) (← links)
- Almost every graph is divergent under the biclique operator (Q908300) (← links)
- The clique operator on circular-arc graphs (Q987670) (← links)
- The clique operator on matching and chessboard graphs (Q998495) (← links)
- The complexity of clique graph recognition (Q1019185) (← links)
- On the clique behavior and Hellyness of the complements of regular graphs (Q2099476) (← links)
- On the iterated edge-biclique operator (Q2132393) (← links)
- On the clique behavior of graphs of low degree (Q2141759) (← links)
- The clique operator on graphs with few \(P_{4}\)'s (Q2489945) (← links)
- Termination of the iterated strong-factor operator on multipartite graphs (Q2512660) (← links)
- The number of convergent graphs under the biclique operator with no twin vertices is finite (Q2840544) (← links)
- On the clique behavior of circulants with three small jumps (Q2840560) (← links)
- Linear-time algorithm for the matched-domination problem in cographs (Q3101607) (← links)
- On the Iterated Biclique Operator (Q4920658) (← links)
- On the edge‐biclique graph and the iterated edge‐biclique operator (Q6081559) (← links)