Graph partition into \(K_{3}\)s and \(K_{4}\)s (Q711522): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s12190-009-0320-z
+Normal rank
@@ Property / OpenAlex ID @@
+W2025080871
@@ Property / OpenAlex ID: W2025080871 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3097395
@@ Property / cites work: Q3097395 / rank @@
+Normal rank
@@ Property / cites work @@
+Degree conditions for 2-factors
@@ Property / cites work: Degree conditions for 2-factors / rank @@
+Normal rank
@@ Property / cites work @@
+On the maximal number of independent circuits in a graph
+Normal rank
@@ Property / cites work @@
+On the maximal number of independent triangles in graphs
+Normal rank
@@ Property / cites work @@
+On the maximum number of independent cycles in a graph
+Normal rank
@@ Property / cites work @@
+Disjoint triangles and quadrilaterals in a graph
@@ Property / cites work: Disjoint triangles and quadrilaterals in a graph / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:711522