This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
B. Alspach, Research problems, Problem 3, Discrete Mathematics 36 (1981), 333.
M. Augier and S. Eliahou, Parity-regular Steinhaus graphs, in preparation.
J. Cáceres, A. Márquez, O.R. Oellerman, M.L. Puertas, Rebuilding convex sets in graphs, Discrete Math. 297(1–3) (2005), 26–37.
J. Cáceres, C. Hernando, M. Mora, I.M. Pelayo, M.L. Puertas and C. Seara. Geodeticity of the contour of chordal graphs, Submitted to Disc. Appl. Math.
K. Cameron, E.E. Eschen, C.T. Hoang and R. Sritharan, The list partition problem for graphs, Proc. 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2004), 391–399.
W. Dymacek, Steinhaus graphs, Proc. 10th southeast. Conf. Combinatorics, Graph Theory and Computing, Boca Raton 1979, Vol. I, Congr. Numerantium 23 (1979) 399–412.
S. Even, A. Itai and A. Shamir, On the complexity of timetable and multicommodity flow problems, SIAM J. Comp. 5 (1976) 691–703.
T. Feder, P. Hell, D. Kral and J. Sgall, Two algorithms for list matrix partitions, Proc. 16th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), (2005), 870–876.
N. Garg, V.V. Vazirani and M. Yannakakis, Primal-dual approximation algorithms for integral flow and multicut in trees, Algorithmica 18 (1997) 3–20.
M. Haviv and E. Korach, On graph partitioning and determining near uncoupling in Markov chains, in preparation.
E. Korach and M. Penn, A fast algorithm for maximum integral two-commodity flow in planar graphs, Discrete Applied Mathematics 47 (1993) 77–83.
J.L. Ramírez Alfonsín, Topics in Combinatorics and Computational Complexity, D.Phil. Thesis, University of Oxford, U.K., (1993).
N. Robertson and P.D. Seymour, Graphs minors XIII: The disjoint paths problem, J. Comb. Theory, Ser. B, 63 (1995) 65–110.
G. Sierksma, Relationships between Carathéodory, Helly, Radon and exchange numbers of convexity spaces, Nieuw Archief voor Wisk., 25(2) (1977) 115–132.
M. Van de Vel, Theory of convex structures, North-Holland, Amsterdam, MA (1993).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Birkhäuser Verlag Basel/Switzerland
About this chapter
Cite this chapter
Murty, U.S.R. (2006). Open Problems. In: Bondy, A., Fonlupt, J., Fouquet, JL., Fournier, JC., Ramírez Alfonsín, J.L. (eds) Graph Theory in Paris. Trends in Mathematics. Birkhäuser Basel. https://doi.org/10.1007/978-3-7643-7400-6_31
Download citation
DOI: https://doi.org/10.1007/978-3-7643-7400-6_31
Publisher Name: Birkhäuser Basel
Print ISBN: 978-3-7643-7228-6
Online ISBN: 978-3-7643-7400-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)