Computing the forcing spectrum of outerplanar graphs in polynomial time
arXiv2401.17704MaRDI QIDQ6519675FDOQ6519675
Authors: Maximilian Gorsky, Fabian Kreßin 
Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Chemical graph theory (05C92)
This page was built for publication: Computing the forcing spectrum of outerplanar graphs in polynomial time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6519675)
