Decycling bipartite graphs

DOI10.7155/JGAA.00567MaRDI QIDQ5084689zbMATH OpenOpenAlexFDO

Authors Alain Hertz

Publication date 28 June 2022

Published in Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.7155/jgaa.00567

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Decycling the Cartesian product of a bipartite graph with K₂
• scientific article; zbMATH DE number 1744105
• Decycling graphs
• Combinatorial Geometry and Graph Theory
• Decycling cubes and grids

Cites work

• A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
• A group-theoretic model for symmetric interconnection networks
• Almost exact minimum feedback vertex set in meshes and butterflies
• Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference
• Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem
• Decycling bubble sort graphs
• Decycling cubes and grids
• Decycling graphs
• Decycling hypercubes
• Decycling of Fibonacci cubes
• Feedback vertex set in hypercubes
• Feedback vertex sets in star graphs
• Future paths for integer programming and links to artificial intelligence
• Generalized fibonacci cubes are mostly hamiltonian
• scientific article; zbMATH DE number 1033414 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• scientific article; zbMATH DE number 1157214 (Why is no real title available?)
• scientific article; zbMATH DE number 1744105 (Why is no real title available?)
• scientific article; zbMATH DE number 1443271 (Why is no real title available?)
• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• scientific article; zbMATH DE number 3397597 (Why is no real title available?)
• Minimum feedback vertex sets in cocomparability graphs and complex bipartite graphs
• On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three
• Reducibility among combinatorial problems
• Solving the feedback vertex set problem on undirected graphs
• Structural and enumerative properties of the Fibonacci cubes

Cited in

(4)

• Decycling the Cartesian product of a bipartite graph with K₂
• Decycling bipartite tournaments by deleting arcs.
• Decycling bubble sort graphs
• Solution of a conjecture of Vandell on decycling bipartite tournaments by deleting arcs

This page was built for publication: Decycling bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084689)