A model for finding transition-minors

DOI10.1016/j.dam.2020.01.006zbMath1442.05121OpenAlexW3008354726MaRDI QIDQ2192081

Herbert Fleischner, Günther R. Raidl, Benedikt Klocker

Publication date: 29 June 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.01.006

zbMATH Keywords

integer programmingcycle double covercompatible circuit decompositiontransition minor

Mathematics Subject Classification ID

Integer programming (90C10) Graph minors (05C83) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Uses Software

• nauty
• Gurobi
• House of Graphs
• Traces

Cites Work

• Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden
• Circuit decompositions of Eulerian graphs
• House of Graphs: a database of interesting graphs
• Graph minors. XIII: The disjoint paths problem
• Cycle covers. III: Compatible circuit decomposition and \(K_5\)-transition minor
• Practical graph isomorphism. II.
• Integer Programming Formulation of Traveling Salesman Problems
• Optimization and Recognition for K 5-minor Free Graphs in Linear Time
• Polyhedral decompositions of cubic graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: A model for finding transition-minors