Zap. Nauchn. Sem. POMI, 2020, Volume 497

Zapiski Nauchnykh Seminarov POMI

RUS ENG

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

2020, Volume 497

Contents

Combinatorics and graph theory. Part XII

	Algorithm for sequential construction of spanning minimal directed forests V. A. Buslov		5–25
	An exact bound on the number of proper $3$-edge-colorings of a connected cubic graph M. P. Ivanov		26–52
	Criterion for the existence of such a cycle that vertices beyond this cycle are independent N. A. Karol'		53–79
	On semi-reconstruction of graphs of connectivity $2$ D. V. Karpov		80–99
	Partitioning of plane sets into $6$ subsets of small diameter V. O. Koval'		100–123
	Upper and lower bounds on the height of proofs in sequent calculus for intuitionistic logic V. P. Orevkov		124–169