Cycle-connected mixed graphs and related problems

DOI10.1007/S10878-022-00979-3MaRDI QIDQ5918609zbMATH OpenOpenAlexFDO

Authors Junran Lichen

Publication date 17 January 2023

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-022-00979-3

zbMATH Keywords

circuit-connected mixed graphscombinatorial algorithmscombinatorial optimizationcycle-connected mixed graphscycle-connectivity

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
• On the Circuit Cover Problem for Mixed Graphs
• A note on orientations of mixed graphs
• On negative cycles in mixed graphs
• Disjoint directed and undirected paths and cycles in digraphs

Cites work

• 2-linked graphs
• k-linked and k-cyclic digraphs
• A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
• A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
• A polynomial algorithm determining cyclic vertex connectivity of 4-regular graphs
• A polynomial algorithm determining cyclic vertex connectivity of \(k\)-regular graphs with fixed \(k\)
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Combinatorial optimization. Theory and algorithms.
• Computing Vertex Connectivity: New Bounds from Old Techniques
• Computing vertex-disjoint paths in large graphs using MAOs
• Digraphs. Theory, algorithms and applications
• Graph theory
• Highly connected non-2-linked digraphs
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 1219584 (Why is no real title available?)
• scientific article; zbMATH DE number 3349645 (Why is no real title available?)
• Network Flow and Testing Graph Connectivity
• Network flows. Theory, algorithms, and applications.
• On \(k\)-strong and \(k\)-cyclic digraphs
• On several sorts of connectivity
• Pendant tree-connectivity
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Strong subgraph k‐connectivity
• The cubic graphs with finite cyclic vertex connectivity larger than girth
• The directed subgraph homeomorphism problem

Cited in

(3)

• On negative cycles in mixed graphs
• Integral mixed circulant graphs
• Short cycle connectivity

This page was built for publication: Cycle-connected mixed graphs and related problems

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