Clique‐width: Harnessing the power of atoms

Article Properties
  • Language
    English
  • DOI (url)
  • Publication Date
    2023/07/10
  • Indian UGC (journal)
  • Refrences
    65
  • Konrad K. Dabrowski School of Computing Newcastle University Newcastle upon Tyne UK ORCID (unauthenticated)
  • Tomáš Masařík Faculty of Mathematics and Physics Charles University Prague Czech RepublicInstitute of Informatics University of Warsaw Warsaw PolandDepartment of Mathematics Simon Fraser University Burnaby Canada ORCID (unauthenticated)
  • Jana Novotná Faculty of Mathematics and Physics Charles University Prague Czech RepublicInstitute of Informatics University of Warsaw Warsaw Poland ORCID (unauthenticated)
  • Daniël Paulusma Department of Computer Science Durham University Durham UK ORCID (unauthenticated)
  • Paweł Rzążewski Institute of Informatics University of Warsaw Warsaw PolandFaculty of Mathematics and Information Science Warsaw University of Technology Warsaw Poland ORCID (unauthenticated)
Abstract
Cite
Dabrowski, Konrad K., et al. “Clique‐width: Harnessing the Power of Atoms”. Journal of Graph Theory, vol. 104, no. 4, 2023, pp. 769-10, https://doi.org/10.1002/jgt.23000.
Dabrowski, K. K., Masařík, T., Novotná, J., Paulusma, D., & Rzążewski, P. (2023). Clique‐width: Harnessing the power of atoms. Journal of Graph Theory, 104(4), 769-810. https://doi.org/10.1002/jgt.23000
Dabrowski, Konrad K., Tomáš Masařík, Jana Novotná, Daniël Paulusma, and Paweł Rzążewski. “Clique‐width: Harnessing the Power of Atoms”. Journal of Graph Theory 104, no. 4 (2023): 769-810. https://doi.org/10.1002/jgt.23000.
Dabrowski KK, Masařík T, Novotná J, Paulusma D, Rzążewski P. Clique‐width: Harnessing the power of atoms. Journal of Graph Theory. 2023;104(4):769-810.
Refrences
Title Journal Journal Categories Citations Publication Date
P6 ${P}_{6}$‐ and triangle‐free graphs revisited: Structure and bounded clique‐width 2006
The tree‐ and clique‐width of bipartite graphs in special classes 2006
Encyclopedia of Mathematics and its Applications 2012
Bounding the clique-width of H-free split graphs Discrete Applied Mathematics
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Technology: Engineering (General). Civil engineering (General)
11 2016
Graph Isomorphism for $$(H_1,H_2)$$-Free Graphs: An Almost Complete Dichotomy

Algorithmica
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
3 2020