\(\beta \)-degree closures for graphs (Q1025908): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2008.07.036
@@ Property / DOI: 10.1016/j.disc.2008.07.036 / rank @@
-Normal rank
@@ Property / cites work @@
+Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs
+Normal rank
@@ Property / cites work @@
+Semi-independence number of a graph and the existence of Hamiltonian circuits
+Normal rank
@@ Property / cites work @@
+-dual closures for several classes of graphs
@@ Property / cites work: 0-dual closures for several classes of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Extension of several sufficient conditions for Hamiltonian graphs
+Normal rank
@@ Property / cites work @@
+A method in graph theory
@@ Property / cites work: A method in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+A closure concept based on neighborhood unions of independent triples
+Normal rank
@@ Property / cites work @@
+Closure concepts: A survey
@@ Property / cites work: Closure concepts: A survey / rank @@
+Normal rank
@@ Property / cites work @@
+Q5422499
@@ Property / cites work: Q5422499 / rank @@
+Normal rank
@@ Property / cites work @@
+More powerful closure operations on graphs
@@ Property / cites work: More powerful closure operations on graphs / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2008.07.036
@@ Property / DOI: 10.1016/J.DISC.2008.07.036 / rank @@
+Normal rank