Sharp bounds for the Chinese postman problem in 3-regular graphs and multigraphs (Q2352793): 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.2015.03.017
+Normal rank
@@ Property / OpenAlex ID @@
+W2106730442
@@ Property / OpenAlex ID: W2106730442 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3258698
@@ Property / cites work: Q3258698 / rank @@
+Normal rank
@@ Property / cites work @@
+Shortest coverings of graphs with cycles
@@ Property / cites work: Shortest coverings of graphs with cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Maximum matching and a polyhedron with 0,1-vertices
+Normal rank
@@ Property / cites work @@
+Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree
+Normal rank
@@ Property / cites work @@
+On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2352793