Perfect matching cuts partitioning a graph into complementary subgraphs

DOI10.26493/1855-3974.3015.F4AMaRDI QIDQ6996465zbMATH OpenFDO

Authors Diane Castonguay, Erika M. M. Coelho, Hebert Coelho, Julliano Rosa Nascimento, Uéverton S. Souza

Publication date 16 April 2025

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

graph partitioninggraph isomorphismperfect matchingmatching cutcomplementary subgraphs

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76) Graph designs and isomorphic decomposition (05C51)

This page was built for publication: Perfect matching cuts partitioning a graph into complementary subgraphs

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