Partitioning a graph into complementary subgraphs

DOI10.1007/978-3-030-39881-1_19MaRDI QIDQ5896124zbMATH OpenOpenAlexFDO

Authors Uéverton S. Souza, Julliano Rosa Nascimento, Jayme L. Szwarcfiter

Publication date 22 July 2020

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-39881-1_19

zbMATH Keywords

complementary subgraphsgraph isomorphismgraph partitioningpartition

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Partitioning a graph into complementary subgraphs
• Partial complementation of graphs
• Subgraph complementation
• Recognizing some complementary products

Cited in

(7)

• Partitioning graphs into complete and empty graphs
• Subgraph complementation
• Partitioning a graph into two pieces, each isomorphic to the other or to its complement
• Partition of a graph with its complete sub-graphs
• Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs
• scientific article; zbMATH DE number 4187858 (Why is no real title available?)
• Partitioning a graph into complementary subgraphs

This page was built for publication: 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 Q5896124)