Nearly bipartite graphs (Q1412666): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+On the connection between chromatic number, maximal clique and minimal degree of a graph
+Normal rank
@@ Property / cites work @@
+Q4398864
@@ Property / cites work: Q4398864 / rank @@
+Normal rank
@@ Property / cites work @@
+Cycles of even length in graphs
@@ Property / cites work: Cycles of even length in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4071278
@@ Property / cites work: Q4071278 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4873821
@@ Property / cites work: Q4873821 / rank @@
+Normal rank
@@ Property / cites work @@
+On maximal paths and circuits of graphs
@@ Property / cites work: On maximal paths and circuits of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs without short odd cycles are nearly bipartite
+Normal rank
@@ Property / cites work @@
+ODD Cycles of Specified Length in Non-Bipartite Graphs
+Normal rank
@@ Property / cites work @@
+On Arithmetic Progressions of Cycle Lengths in Graphs
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0012-365x(03)00076-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2054235532
@@ Property / OpenAlex ID: W2054235532 / rank @@
+Normal rank