scientific article; zbMATH DE number 2097774

zbMATH Open1054.05092MaRDI QIDQ4814092FDOQ4814092

Authors: Jurriaan Hage, Tero Harju, Emo Welzl 

Publication date: 7 September 2004

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 2016073
• On graphs with maximum size in their switching classes.
• scientific article; zbMATH DE number 4057569
• Acyclicity of switching classes
• Pancyclicity in switching classes

zbMATH Keywords

algorithmsswitching classes

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Cited In (12)

• Title not available (Why is that?)
• Cutting a tree with subgraph complementation is hard, except for some small trees
• Cutting a tree with subgraph complementation is hard, except for some small trees
• On graphs with maximum size in their switching classes.
• On equiangular lines in $17$ dimensions and the characteristic polynomial of a Seidel matrix
• A Characterization of Acyclic Switching Classes of Graphs Using Forbidden Subgraphs
• Equiangular lines in Euclidean spaces
• Towards a characterization of bipartite switching classes by means of forbidden subgraphs
• The embedding problem for switching classes of graphs
• Hermitian matrices of roots of unity and their characteristic polynomials
• An algorithmic study of switch graphs
• Equiangular line systems and switching classes containing regular graphs

This page was built for publication:

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