Termination of the iterated strong-factor operator on multipartite graphs
From MaRDI portal
Publication:2512660
DOI10.1016/J.TCS.2015.01.009zbMATH Open1306.05234OpenAlexW1974993785MaRDI QIDQ2512660FDOQ2512660
Authors: Christophe Crespelle, The Hung Tran, Thi Ha Duong Phan 
Publication date: 30 January 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.01.009
Recommendations
- On the termination of some biclique operators on multipartite graphs
- On the strong partition dimension of graphs
- A result on the strength of graphs by factorizations of complete graphs
- On path factorizations of complete multipartite graphs
- scientific article; zbMATH DE number 5823698
- A note on strongly multiplicative graphs
- Termination of multipartite graph series arising from complex network modelling
- scientific article; zbMATH DE number 6181702
- Maskless etching of silicon using patterned microdischarges
- Strong \(f\)-star factors of graphs
Cites Work
- Title not available (Why is that?)
- Edge-clique graphs
- Title not available (Why is that?)
- The clique operator on circular-arc graphs
- The clique operator on cographs and serial graphs
- Convergence of iterated clique graphs
- Clique divergent clockwork graphs and partial orders
- On clique convergent graphs
- Bipartite structure of all complex networks
- The number of convergent graphs under the biclique operator with no twin vertices is finite
- Termination of multipartite graph series arising from complex network modelling
- On the iterated biclique operator
- On the termination of some biclique operators on multipartite graphs
- Title not available (Why is that?)
- Contractibility and the clique graph operator
Cited In (4)
This page was built for publication: Termination of the iterated strong-factor operator on multipartite graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2512660)
