Complement-equivalence classes on graphs

DOI10.1007/3-540-63246-8_11MaRDI QIDQ4362733zbMATH OpenFDO

Authors R. M. McConnell

Publication date 17 March 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-63246-8_11

zbMATH Keywords

complementation operation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1753166
• Simple DFS on the complement of a graph and on partially complemented digraphs
• scientific article; zbMATH DE number 1003286
• An efficient algorithm to recognize locally equivalent graphs

Cited in

(9)

• Classes of graphs which approximate the complete Euclidean graph
• Equivalence classes in matching covered graphs
• Speeding up Graph Algorithms via Switching Classes
• scientific article; zbMATH DE number 5957357 (Why is no real title available?)
• Simple DFS on the complement of a graph and on partially complemented digraphs
• scientific article; zbMATH DE number 5291590 (Why is no real title available?)
• scientific article; zbMATH DE number 1753166 (Why is no real title available?)
• Recognizing locally equivalent graphs
• Computing equivalence classes among the edges of a graph with applications

This page was built for publication: Complement-equivalence classes on graphs

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