Keevash, Peter; Sudakov, Benny Sparse halves in triangle-free graphs. (English) Zbl 1092.05034 J. Comb. Theory, Ser. B 96, No. 4, 614-620 (2006). MSC: 05C35 PDFBibTeX XMLCite \textit{P. Keevash} and \textit{B. Sudakov}, J. Comb. Theory, Ser. B 96, No. 4, 614--620 (2006; Zbl 1092.05034) Full Text: DOI
Bilu, Yonatan Tales of Hoffman: three extensions of Hoffman’s bound on the graph chromatic number. (English) Zbl 1094.05036 J. Comb. Theory, Ser. B 96, No. 4, 608-613 (2006). Reviewer: Stanislav Jendrol’ (Košice) MSC: 05C50 05C15 PDFBibTeX XMLCite \textit{Y. Bilu}, J. Comb. Theory, Ser. B 96, No. 4, 608--613 (2006; Zbl 1094.05036) Full Text: DOI arXiv
Polcyn, Joanna; Rödl, Vojtech; Ruciński, Andrzej; Szemerédi, Endre Short paths in quasi-random triple systems with sparse underlying graphs. (English) Zbl 1091.05009 J. Comb. Theory, Ser. B 96, No. 4, 584-607 (2006). MSC: 05B07 05C65 05C80 05C38 PDFBibTeX XMLCite \textit{J. Polcyn} et al., J. Comb. Theory, Ser. B 96, No. 4, 584--607 (2006; Zbl 1091.05009) Full Text: DOI
Akbari, Saieed; Mirrokni, Vahab S.; Sadjad, Bashir S. A relation between choosability and uniquely list colorability. (English) Zbl 1100.05032 J. Comb. Theory, Ser. B 96, No. 4, 577-583 (2006). Reviewer: Tomáš Dvořák (Praha) MSC: 05C15 PDFBibTeX XMLCite \textit{S. Akbari} et al., J. Comb. Theory, Ser. B 96, No. 4, 577--583 (2006; Zbl 1100.05032) Full Text: DOI
Lai, Hong-Jian; Shao, Yehong; Wu, Hehui; Zhou, Ju Every 3-connected, essentially 11-connected line graph is Hamiltonian. (English) Zbl 1091.05040 J. Comb. Theory, Ser. B 96, No. 4, 571-576 (2006). MSC: 05C45 PDFBibTeX XMLCite \textit{H.-J. Lai} et al., J. Comb. Theory, Ser. B 96, No. 4, 571--576 (2006; Zbl 1091.05040) Full Text: DOI HAL
Geelen, J.; Gerards, B.; Robertson, N.; Whittle, G. Obstructions to branch-decomposition of matroids. (English) Zbl 1094.05011 J. Comb. Theory, Ser. B 96, No. 4, 560-570 (2006). Reviewer: Kelly J. Pearson (Murray) MSC: 05B35 PDFBibTeX XMLCite \textit{J. Geelen} et al., J. Comb. Theory, Ser. B 96, No. 4, 560--570 (2006; Zbl 1094.05011) Full Text: DOI
Ellingham, M. N.; Stephens, Chris; Zha, Xiaoya The nonorientable genus of complete tripartite graphs. (English) Zbl 1097.05014 J. Comb. Theory, Ser. B 96, No. 4, 529-559 (2006). Reviewer: Arthur T. White (Kalamazoo) MSC: 05C10 PDFBibTeX XMLCite \textit{M. N. Ellingham} et al., J. Comb. Theory, Ser. B 96, No. 4, 529--559 (2006; Zbl 1097.05014) Full Text: DOI
Oum, Sang-Il; Seymour, Paul Approximating clique-width and branch-width. (English) Zbl 1114.05022 J. Comb. Theory, Ser. B 96, No. 4, 514-528 (2006). Reviewer: Brigitte Servatius (Worcester) MSC: 05B35 05C70 PDFBibTeX XMLCite \textit{S.-I. Oum} and \textit{P. Seymour}, J. Comb. Theory, Ser. B 96, No. 4, 514--528 (2006; Zbl 1114.05022) Full Text: DOI
Norine, Serguei; Thomas, Robin Minimal bricks. (English) Zbl 1092.05056 J. Comb. Theory, Ser. B 96, No. 4, 505-513 (2006). MSC: 05C70 PDFBibTeX XMLCite \textit{S. Norine} and \textit{R. Thomas}, J. Comb. Theory, Ser. B 96, No. 4, 505--513 (2006; Zbl 1092.05056) Full Text: DOI arXiv
Lai, Hong-Jian; Shao, Yehong; Zhan, Mingquan Hamiltonicity in 3-connected claw-free graphs. (English) Zbl 1095.05024 J. Comb. Theory, Ser. B 96, No. 4, 493-504 (2006). Reviewer: Stanislav Jendrol’ (Košice) MSC: 05C45 PDFBibTeX XMLCite \textit{H.-J. Lai} et al., J. Comb. Theory, Ser. B 96, No. 4, 493--504 (2006; Zbl 1095.05024) Full Text: DOI
Yu, Xingxing; Zickfeld, Florian Reducing Hajós’ 4-coloring conjecture to 4-connected graphs. (English) Zbl 1091.05030 J. Comb. Theory, Ser. B 96, No. 4, 482-492 (2006). MSC: 05C15 05C40 PDFBibTeX XMLCite \textit{X. Yu} and \textit{F. Zickfeld}, J. Comb. Theory, Ser. B 96, No. 4, 482--492 (2006; Zbl 1091.05030) Full Text: DOI
Albertson, Michael O.; West, Douglas B. Extending precolorings to circular colorings. (English) Zbl 1180.05040 J. Comb. Theory, Ser. B 96, No. 4, 472-481 (2006). Reviewer: Karen L. Collins (MR2232385) MSC: 05C15 PDFBibTeX XMLCite \textit{M. O. Albertson} and \textit{D. B. West}, J. Comb. Theory, Ser. B 96, No. 4, 472--481 (2006; Zbl 1180.05040) Full Text: DOI
Hliněný, Petr Crossing number is hard for cubic graphs. (English) Zbl 1092.05016 J. Comb. Theory, Ser. B 96, No. 4, 455-471 (2006). MSC: 05C10 68R10 PDFBibTeX XMLCite \textit{P. Hliněný}, J. Comb. Theory, Ser. B 96, No. 4, 455--471 (2006; Zbl 1092.05016) Full Text: DOI
Montellano-Ballesteros, Juan José; Strausz, Ricardo A characterization of cocircuit graphs of uniform oriented matroids. (English) Zbl 1109.52016 J. Comb. Theory, Ser. B 96, No. 4, 445-454 (2006). Reviewer: J. L. Ramirez Alfonsin (Paris) MSC: 52C40 05C10 05C75 PDFBibTeX XMLCite \textit{J. J. Montellano-Ballesteros} and \textit{R. Strausz}, J. Comb. Theory, Ser. B 96, No. 4, 445--454 (2006; Zbl 1109.52016) Full Text: DOI