Isomorphism for Graphs of Bounded Feedback Vertex Set Number

DOI10.1007/978-3-642-13731-0_9zbMath1284.05296OpenAlexW1513930338MaRDI QIDQ3569881

Pascal Schweitzer, Stefan Kratsch

Publication date: 22 June 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13731-0_9

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items

Graph isomorphism parameterized by elimination distance to bounded degree, Graph isomorphism for graph classes characterized by two forbidden induced subgraphs, Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter, Two-layer planarization parameterized by feedback edge set, FPT algorithms to compute the elimination distance to bipartite graphs and more, Parameterized complexity of vertex deletion into perfect graph classes, Order Reconfiguration under Width Constraints, Induced minor free graphs: isomorphism and clique-width, Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth, On the tractability of \(( k , i )\)-coloring, Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications, Colored hypergraph isomorphism is fixed parameter tractable, Parameterized Complexity of Vertex Deletion into Perfect Graph Classes