On partial descriptions of König graphs for odd paths and all their spanning supergraphs (Q2115309): Difference between revisions

@@ Property / author @@
-Dmitriy S. Malyshev
@@ Property / author: Dmitriy S. Malyshev / rank @@
-Normal rank
@@ Property / author @@
+Dmitriy S. Malyshev
@@ Property / author: Dmitriy S. Malyshev / rank @@
+Normal rank
@@ 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/s11590-021-01771-8
+Normal rank
@@ Property / OpenAlex ID @@
+W3175559044
@@ Property / OpenAlex ID: W3175559044 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5263777
@@ Property / cites work: Q5263777 / rank @@
+Normal rank
@@ Property / cites work @@
+König graphs for 3-paths and 3-cycles
@@ Property / cites work: König graphs for 3-paths and 3-cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum \(k\)-path vertex cover
@@ Property / cites work: Minimum \(k\)-path vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Optimization
@@ Property / cites work: Combinatorial Optimization / rank @@
+Normal rank
@@ Property / cites work @@
+Independence numbers of graphs - an extension of the Koenig-Egervary theorem
+Normal rank
@@ Property / cites work @@
+Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2816101
@@ Property / cites work: Q2816101 / rank @@
+Normal rank
@@ Property / cites work @@
+On computing the minimum 3-path vertex cover and dissociation number of graphs
+Normal rank
@@ Property / cites work @@
+On the completeness of a generalized matching problem
+Normal rank
@@ Property / cites work @@
+Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph
+Normal rank
@@ Property / cites work @@
+A 2-approximation algorithm for the vertex cover<i>P</i><sub>4</sub>problem in cubic graphs
+Normal rank
@@ Property / cites work @@
+König Graphs with Respect to the 4-Path and Its Spanning Supergraphs
+Normal rank
@@ Property / cites work @@
+Chain packing in graphs
@@ Property / cites work: Chain packing in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On König graphs with respect to P4
@@ Property / cites work: On König graphs with respect to P4 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs
+Normal rank
@@ Property / cites work @@
+A characterization of the graphs in which the transversal number equals the matching number
+Normal rank
@@ Property / cites work @@
+A primal-dual approximation algorithm for the vertex cover \(P^3\) problem
+Normal rank
@@ Property / cites work @@
+Combinatorial and computational aspects of graph packing and graph decomposition
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2115309