On partial descriptions of König graphs for odd paths and all their spanning supergraphs
From MaRDI portal
Publication:2115309
DOI10.1007/S11590-021-01771-8zbMATH Open1487.90563OpenAlexW3175559044MaRDI QIDQ2115309FDOQ2115309
Publication date: 15 March 2022
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-021-01771-8
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Paths, Trees, and Flowers
- Independence numbers of graphs - an extension of the Koenig-Egervary theorem
- Minimum \(k\)-path vertex cover
- König graphs for 3-paths and 3-cycles
- A 2-approximation algorithm for the vertex coverP4problem in cubic graphs
- On the completeness of a generalized matching problem
- On computing the minimum 3-path vertex cover and dissociation number of graphs
- A primal-dual approximation algorithm for the vertex cover \(P^3\) problem
- Graph packings
- Combinatorial optimization. Packing and covering
- A characterization of the graphs in which the transversal number equals the matching number
- Combinatorial and computational aspects of graph packing and graph decomposition
- Computational complexity of minimum \(P_4\) vertex cover problem for regular and \(K_{1, 4}\)-free graphs
- Chain packing in graphs
- Tighter bounds on the size of a maximum \(P_{3}\)-matching in a cubic graph
- A polynomial-time algorithm of finding a minimum \(k\)-path vertex cover and a maximum \(k\)-path packing in some graphs
- König Graphs with Respect to the 4-Path and Its Spanning Supergraphs
- On König graphs with respect to P4
Cited In (1)
This page was built for publication: On partial descriptions of König graphs for odd paths and all their spanning supergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2115309)
