共 50 条
- [2] Approximating coloring and maximum independent sets in 3-uniform hypergraphs [J]. JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2001, 41 (01): : 99 - 113
- [3] Approximating coloring and maximum independent sets in 3-uniform hypergraphs [J]. PROCEEDINGS OF THE TWELFTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2001, : 327 - 328
- [4] Decompositions of complete 3-uniform hypergraphs into small 3-uniform hypergraphs [J]. AUSTRALASIAN JOURNAL OF COMBINATORICS, 2014, 60 : 227 - 254
- [5] Hardness results for coloring 3-colorable 3-uniform hypergraphs [J]. FOCS 2002: 43RD ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2002, : 23 - 32
- [7] Edge intersection graphs of linear 3-uniform hypergraphs [J]. DISCRETE MATHEMATICS, 2009, 309 (11) : 3500 - 3517
- [9] Matchings in 3-uniform hypergraphs [J]. JOURNAL OF COMBINATORIAL THEORY SERIES B, 2013, 103 (02) : 291 - 305