Max-cut in circulant graphs (Q1201272): Difference between revisions

@@ Property / author @@
+Daniel Turzík
@@ Property / author: Daniel Turzík / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Isomorphism of circulant graphs and digraphs
@@ Property / cites work: Isomorphism of circulant graphs and digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Facets of the Bipartite Subgraph Polytope
@@ Property / cites work: Facets of the Bipartite Subgraph Polytope / rank @@
+Normal rank
@@ Property / cites work @@
+On the cut polytope
@@ Property / cites work: On the cut polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Facets for the cut cone. I
@@ Property / cites work: Facets for the cut cone. I / rank @@
+Normal rank
@@ Property / cites work @@
+Circulants and their connectivities
@@ Property / cites work: Circulants and their connectivities / rank @@
+Normal rank
@@ Property / cites work @@
+Some simplified NP-complete graph problems
@@ Property / cites work: Some simplified NP-complete graph problems / rank @@
+Normal rank
@@ Property / cites work @@
+Extremal bipartite subgraphs of cubic triangle-free graphs
+Normal rank
@@ Property / cites work @@
+Maximumk-colorable subgraphs
@@ Property / cites work: Maximumk-colorable subgraphs / rank @@
+Normal rank
@@ Property / cites work @@
+A remark on max-cut problem with an application to digital-analogue convertors
+Normal rank
@@ Property / cites work @@
+A Polynomial Algorithm for Constructing a Large Bipartite Subgraph, with an Application to a Satisfiability Problem
+Normal rank
@@ Property / cites work @@
+A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound
+Normal rank
@@ Property / cites work @@
+On a facet of the balanced subgraph polytope
@@ Property / cites work: On a facet of the balanced subgraph polytope / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum bipartite subgraphs of Kneser graphs
@@ Property / cites work: Maximum bipartite subgraphs of Kneser graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the number of spanning trees of circulant graphs
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/0012-365x(92)90690-h
+Normal rank
@@ Property / OpenAlex ID @@
+W1981069811
@@ Property / OpenAlex ID: W1981069811 / rank @@
+Normal rank