An algorithm for identifying cycle-plus-triangles graphs (Q2357769): 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.1016/j.dam.2017.04.021
+Normal rank
@@ Property / OpenAlex ID @@
+W2615239789
@@ Property / OpenAlex ID: W2615239789 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Nullstellensatz
@@ Property / cites work: Combinatorial Nullstellensatz / rank @@
+Normal rank
@@ Property / cites work @@
+The Hamiltonian property of consecutive-\(d\) digraphs
+Normal rank
@@ Property / cites work @@
+An extension of DHH-Erdős conjecture on cycle-plus-triangle graphs
+Normal rank
@@ Property / cites work @@
+Q3983100
@@ Property / cites work: Q3983100 / rank @@
+Normal rank
@@ Property / cites work @@
+A solution to a colouring problem of P. Erdős
@@ Property / cites work: A solution to a colouring problem of P. Erdős / rank @@
+Normal rank
@@ Property / cites work @@
+Q5689006
@@ Property / cites work: Q5689006 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4284625
@@ Property / cites work: Q4284625 / rank @@
+Normal rank