On graphs with maximum size in their switching classes.

DOI10.14712/1213-7243.015.105MaRDI QIDQ5248282zbMATH OpenOpenAlexFDO

Authors Sergiy Kozerenko

Publication date 6 May 2015

Published in Commentationes Mathematicae Universitatis Carolinae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.14712/1213-7243.015.105

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

maximum size graphSeidel switchingswitching class

Mathematics Subject Classification ID

Distance in graphs (05C12) Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Recommendations

• scientific article; zbMATH DE number 4057569
• scientific article; zbMATH DE number 2097774
• On perfect switching classes
• scientific article; zbMATH DE number 2016073
• scientific article; zbMATH DE number 1409233

Cited in

(5)

• On the hardness of switching to a small number of edges
• scientific article; zbMATH DE number 2097774 (Why is no real title available?)
• scientific article; zbMATH DE number 7535774 (Why is no real title available?)
• On all-path convex, gated and Chebyshev sets in graphs
• On the hardness of switching to a small number of edges

This page was built for publication: On graphs with maximum size in their switching classes.

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