Partitioning a graph into complementary subgraphs

DOI10.1007/s00373-021-02319-4zbMath1469.05144OpenAlexW4253147742MaRDI QIDQ5918340

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

Publication date: 28 July 2021

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-021-02319-4

zbMATH Keywords

graph partitioninggraph isomorphismcomplementary subgraphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Perfect matching cuts partitioning a graph into complementary subgraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Recognizing some complementary products
• Characterizing and edge-colouring split-indifference graphs
• Algorithmic graph theory and perfect graphs
• Threshold graphs and related topics
• Complexity of graph partition problems
• On the Cutwidth and the Topological Bandwidth of a Tree
• A Linear Recognition Algorithm for Cographs
• On testing isomorphism of permutation graphs
• On the Polarity and Monopolarity of Graphs
• Partitioning a graph into complementary subgraphs