J. Comb. Theory, Ser. B

8 papers4 directions
The Journal of Combinatorial Theory, Series B is a publication focused on graph theory, matroid theory, and related combinatorial structures. Within the context of machine learning and artificial intelligence, the venue provides the theoretical and mathematical foundations for graph-based models and discrete optimization. Data from 1992 to 2020 shows the venue’s role in publishing research that addresses the structural properties of graphs and the algorithmic challenges associated with them. Research published here includes studies on Tutte polynomials, judicious bipartitions, and the Edmonds-Johnson property. These topics are relevant to AI subfields such as graph neural networks, network flow optimization, and constraint satisfaction. The venue also features work on graph colorability, choosability, and local routing, which are central to understanding the complexity and efficiency of algorithms used in automated reasoning and large-scale data processing. Notable contributors to the venue include researchers such as Olivier Bernardi, Jie Ma, Xingxing Yu, and Alberto Del Pia. Their work often explores fundamental concepts like upper bounds on obstructions, intertwines, and disjoint directed cycles. By focusing on these rigorous mathematical properties, the journal supports the development of new methodologies for analyzing complex relational data and improving the performance of combinatorial algorithms in AI systems.

Papers by Year

2020 1
2019 1
2018 1
2006 1
2001 1
1998 1
1996 1
1992 1

Top Research Directions

Research directions most represented by papers from this venue.

Completely Log Concave Polynomials for Matroid Inequalities 1
The Polynomial Erdős-Pósa Property in Directed Graphs 1
Structural Induction for Proving Graph Properties 1
Preserving Edge Directionality in Graph Neural Networks 1

Top Authors

AuthorPapers
Vahab Mirrokni2
Alberto Del Pia1
Jens Lagergren1
Kurt Mehlhorn1
Noga Alon1
Yuliang Ji1

Impactful Papers

Papers from this venue that shaped research clusters.

Influential

Papers

TitleYear
Tutte polynomials for directed graphs2020
On problems about judicious bipartitions of graphs2019
On matrices with the Edmonds-Johnson property arising from bidirected graphs2018
A relation between choosability and uniquely list colorability2006
Kr-Free Uniquely Vertex Colorable Graphs with Minimum Possible Edges2001
Upper Bounds on the Size of Obstructions and Intertwines1998
Disjoint Directed Cycles1996
On local routing of two-terminal nets1992