Minimum degree conditions for the proper connection number of graphs (Q2409521): 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/s00373-017-1796-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2618308016
@@ Property / OpenAlex ID: W2618308016 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2829346
@@ Property / cites work: Q2829346 / rank @@
+Normal rank
@@ Property / cites work @@
+Proper connection of graphs
@@ Property / cites work: Proper connection of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the minimum degree and the proper connection number of graphs
+Normal rank
@@ Property / cites work @@
+Q5572939
@@ Property / cites work: Q5572939 / rank @@
+Normal rank
@@ Property / cites work @@
+Long cycles in bipartite graphs
@@ Property / cites work: Long cycles in bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of Hamiltonian prisms
@@ Property / cites work: A characterization of Hamiltonian prisms / rank @@
+Normal rank