Author:
Durand de Gevigney Olivier,Klein Sulamita,Nguyen Viet-Hang,Szigeti Zoltán
Abstract
Abstract
The graph sandwich problem for property Π is defined as follows: Given two graphs G
1=(V,E
1) and G
2=(V,E
2) such that E
1⊆E
2, is there a graph G=(V,E) such that E
1⊆E⊆E
2 which satisfies property Π? We propose to study sandwich problems for properties Π concerning orientations, such as Eulerian orientation of a mixed graph and orientation with given in-degrees of a graph. We present a characterization and a polynomial-time algorithm for solving the m-orientation sandwich problem.
Publisher
Springer Science and Business Media LLC
Reference25 articles.
1. Dantas S, Klein S, Mello CP, Morgana A (2009) The graph sandwich problem for P4-sparse graphs. Discrete Math 309:3664–3673
2. Dantas S, Figueiredo CMH, Golumbic MC, Klein S, Maffray F (2011) The chain graph sandwich problem. Ann Oper Res 188:133–139
3. Dourado M, Petito P, Teixeira RB, Figueiredo CMH (2008) Helly property, clique graphs, complementary graph classes, and sandwich problems. J Braz Comput Soc 14:45–52
4. Edmonds J (1977) Matroid intersection. Discrete Optim 4:39–49 (Proc Adv Res Inst Discrete Optimization and Systems Appl, Banff, Alta)
5. Edmonds J, EL Johnson (1973) Matching, Euler tours and the Chinese postman. Math Program 5:88–124
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Lexicographic Orientation Algorithms;Springer Monographs in Mathematics;2018