Journal of Combinatorial Theory Series B 2008

3 papers
The 2008 volume of the Journal of Combinatorial Theory Series B centered on structural graph theory, with a particular emphasis on graph minors, connectivity, and coloring. Research during this period explored the relationship between connectivity and the formation of large complete bipartite minors, as well as the coloring properties of graphs that exclude specific odd-clique minors. These studies align with ongoing investigations into the structural constraints of forbidden minors and related extremal graph properties. Another research direction represented this year involved flow theory, specifically the conditions for nowhere-zero 3-flows in triangularly connected graphs. This work contributes to the study of integer flows and cycle covers in discrete mathematics. Prolific authors contributing to these themes included Bojan Mohar, John Maharry, Thomas Böhme, and Cun-Quan Zhang. Collectively, the research from this year highlights a focus on the intersection of topological properties and structural invariants, addressing questions regarding graph partitions and minor-closed classes.

Papers

Title
Linear connectivity forces large complete bipartite minors
Note on coloring graphs without odd-<mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" overflow="scroll"><mml:msub><mml:mi>K</mml:mi><mml:mi>k</mml:mi></mml:msub></mml:math>-min
Nowhere-zero 3-flows in triangularly connected graphs