SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Journal of Combinatorial Theory. Series B

Volumn 92, Issue 1, 2004, Pages 1-12

The facets and the symmetries of the approval-voting polytope

(2) Doignon, Jean Paul a Fiorini, Samuel b

a UNIVERSITÉ LIBRE DE BRUXELLES (Belgium)

b EINDHOVEN UNIVERSITY OF TECHNOLOGY (Netherlands)

Author keywords

Approval voting polytope; Automorphism of convex polytope; Facet

Indexed keywords

EID: 4344593629 PISSN: 00958956 EISSN: None Source Type: Journal
DOI: 10.1016/j.jctb.2004.04.001 Document Type: Article

Times cited : (4)

References (20)

1
- 0003904891
- New York: Springer
- Bollobás B. Modern Graph Theory 1998 Springer New York
- (1998) Modern Graph Theory
- Bollobás, B.¹

2
- 0004105436
- Berlin: Springer
- Brouwer A.E. Cohen A.M. Neumaier A. Distance-regular Graphs 1989 Springer Berlin
- (1989) Distance-regular Graphs
- Brouwer, A.E.¹ Cohen, A.M.² Neumaier, A.³

3
- 0002716241
- On certain polytopes associated with graphs
- Chvátal V. On certain polytopes associated with graphs J. Combin. Theory Ser. B 18 1975 138-154
- (1975) J. Combin. Theory Ser. B , vol.18 , pp. 138-154
- Chvátal, V.¹

4
- 4344655023
- Philadelphia, PA
- Cornuéjols G. Combinatorial Optimization: Packing and Covering, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2001.
- (2001) Combinatorial Optimization: Packing and Covering, Society for Industrial and Applied Mathematics (SIAM)
- Cornuéjols, G.¹

5
- 4344640763
- The Johnson graph J(v,k) has connectivity δ
- Daven M. Rodger C.A. The Johnson graph J(v,k) has connectivity δ Congr. Numer. 139 1999 123-128
- (1999) Congr. Numer. , vol.139 , pp. 123-128
- Daven, M.¹ Rodger, C.A.²

6
- 0001387789
- A decomposition theorem for partially ordered sets
- Dilworth R.P. A decomposition theorem for partially ordered sets Ann. Math. 51 1950 161-166
- (1950) Ann. Math. , vol.51 , pp. 161-166
- Dilworth, R.P.¹

7
- 2442673668
- The approval-voting polytope: Combinatorial interpretation of the facets
- Doignon J.-P. Fiorini S. The approval-voting polytope: combinatorial interpretation of the facets Math. Sci. Humaines 161 2003 29-39
- (2003) Math. Sci. Humaines , vol.161 , pp. 29-39
- Doignon, J.-P.¹ Fiorini, S.²

8
- 0031165070
- An approval-voting polytope for linear orders
- Doignon J.-P. Regenwetter M. An approval-voting polytope for linear orders J. Math. Psychol. 41 1997 171-188
- (1997) J. Math. Psychol. , vol.41 , pp. 171-188
- Doignon, J.-P.¹ Regenwetter, M.²

9
- 0036800382
- On the combinatorial structure of the approval-voting polytope
- Doignon J.-P. Regenwetter M. On the combinatorial structure of the approval-voting polytope J. Math. Psychol. 46 2002 554-563
- (2002) J. Math. Psychol. , vol.46 , pp. 554-563
- Doignon, J.-P.¹ Regenwetter, M.²

10
- 0030159565
- A random utility model for approval voting
- Falmagne J.-Cl. Regenwetter M. A random utility model for approval voting J. Math. Psychol. 40 1996 152-159
- (1996) J. Math. Psychol. , vol.40 , pp. 152-159
- Falmagne, J.-Cl.¹ Regenwetter, M.²

11
- 0004652923
- The perfect graph conjecture and pluperfect graph theorem
- R. C. Bose (Ed.), Chapel Hill, NC: University of North Carolina
- Fulkerson D.R. The perfect graph conjecture and pluperfect graph theorem In: Bose R.C. et al. (Eds.) Proceedings of the Second Chapel Hill Conference on Combinatorial Mathematics and its Applications 1970 171-175 University of North Carolina Chapel Hill, NC
- (1970) Proceedings of the Second Chapel Hill Conference on Combinatorial Mathematics and Its Applications , pp. 171-175
- Fulkerson, D.R.¹

12
- 0005388824
- Anti-blocking polyhedra
- Fulkerson D.R. Anti-blocking polyhedra J. Combin. Theory Ser. B 12 1972 50-71
- (1972) J. Combin. Theory Ser. B , vol.12 , pp. 50-71
- Fulkerson, D.R.¹

13
- 0242671662
- On the perfect graph theorem
- T. C. Hu, & S. M. Robinson (Eds.), New York: Academic Press
- Fulkerson D.R. On the perfect graph theorem In: Hu T.C. Robinson S.M. (Eds.) Mathematical Programming 1973 69-76 Academic Press New York
- (1973) Mathematical Programming , pp. 69-76
- Fulkerson, D.R.¹

14
- 49649140846
- Normal hypergraphs and the perfect graph conjecture
- Lovász L. Normal hypergraphs and the perfect graph conjecture Discrete Math. 2 1972 253-267
- (1972) Discrete Math. , vol.2 , pp. 253-267
- Lovász, L.¹

15
- 0012966790
- Eine Eigenschaft der Atome endlicher Graphen
- Mader W. Eine Eigenschaft der Atome endlicher Graphen Arch. Math. (Basel) 22 1971 333-336
- (1971) Arch. Math. (Basel) , vol.22 , pp. 333-336
- Mader, W.¹

16
- 34250429350
- On the facial structure of set packing polyhedra
- Padberg M.W. On the facial structure of set packing polyhedra Math. Programming 5 1973 199-215
- (1973) Math. Programming , vol.5 , pp. 199-215
- Padberg, M.W.¹

17
- 0009686046
- Polyhedral combinatorics
- R. L. Graham, M. Grötschel, & L. Lovász (Eds.), North-Holland, Amsterdam: Elsevier (Chapter 30)
- Schrijver A. Polyhedral combinatorics In: Graham R.L. Grötschel M. Lovász L. (Eds.) Handbook of Combinatorics 1995 1649-1704 Elsevier North-Holland, Amsterdam (Chapter 30)
- (1995) Handbook of Combinatorics , pp. 1649-1704
- Schrijver, A.¹

18
- 0004034019
- The Johns Hopkins University Press, Baltimore, MD
- Trotter W.T. Combinatorics and Partially Ordered Sets: Dimension Theory, The Johns Hopkins University Press, Baltimore, MD, 1992.
- (1992) Combinatorics and Partially Ordered Sets: Dimension Theory
- Trotter, W.T.¹

19
- 0002443025
- Connectivity of transitive graphs
- Watkins M.E. Connectivity of transitive graphs J. Combin. Theory 8 1970 23-29
- (1970) J. Combin. Theory , vol.8 , pp. 23-29
- Watkins, M.E.¹

20
- 0004159676
- Berlin: Springer
- Ziegler G.M. Lectures on Polytopes 1995 Springer Berlin
- (1995) Lectures on Polytopes
- Ziegler, G.M.¹

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.