Compositions of complements of graphs

MaRDI QIDQ2830375zbMATH OpenFDO

Authors Péter Árendás, Ferenc Bencs, Zoltán Blázsik, Csaba Szabó

Publication date 28 October 2016

Published in Integers (Search for Journal in Brave)

Full work available at URL http://www.emis.de/journals/INTEGERS/papers/q29/q29.Abstract.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

connected partition

Mathematics Subject Classification ID

Graph polynomials (05C31) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Counting connected set partitions of graphs
• scientific article; zbMATH DE number 6813595
• scientific article; zbMATH DE number 4139799
• Graph compositions. I: Basic enumeration
• Bounds on graph compositions and the connection to the Bell triangle

Cited in

(9)

• Complement of a graph: a generalization
• scientific article; zbMATH DE number 809166 (Why is no real title available?)
• Counting connected set partitions of graphs
• scientific article; zbMATH DE number 6502039 (Why is no real title available?)
• scientific article; zbMATH DE number 7534344 (Why is no real title available?)
• scientific article; zbMATH DE number 5532174 (Why is no real title available?)
• Compositions constrained by graph Laplacian minors
• On coindices of graphs and their complements
• The partial complement of graphs

This page was built for publication: Compositions of complements of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2830375)