A NOTE ON ALMOST BALANCED BIPARTITIONS OF A GRAPH (Q5245703): Difference between revisions

@@ Property / cites work @@
+Decomposing graphs with girth at least five under degree constraints
+Normal rank
@@ Property / cites work @@
+Graph partitions with minimum degree constraints
@@ Property / cites work: Graph partitions with minimum degree constraints / rank @@
+Normal rank
@@ Property / cites work @@
+On decomposition of triangle-free graphs under degree constraints
+Normal rank
@@ Property / cites work @@
+On circuits in graphs
@@ Property / cites work: On circuits in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex colorings without isolates
@@ Property / cites work: Vertex colorings without isolates / rank @@
+Normal rank
@@ Property / cites work @@
+Q4715286
@@ Property / cites work: Q4715286 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1017/s0004972714000781
+Normal rank
@@ Property / OpenAlex ID @@
+W2160459836
@@ Property / OpenAlex ID: W2160459836 / rank @@
+Normal rank