RUS
ENG
Full version
JOURNALS
// Zapiski Nauchnykh Seminarov POMI
// Archive
2020, Volume 497
|
General information
|
Contents
|
Combinatorics and graph theory. Part XII
Algorithm for sequential construction of spanning minimal directed forests
V. A. Buslov
5
An exact bound on the number of proper
$3$
-edge-colorings of a connected cubic graph
M. P. Ivanov
26
Criterion for the existence of such a cycle that vertices beyond this cycle are independent
N. A. Karol'
53
On semi-reconstruction of graphs of connectivity
$2$
D. V. Karpov
80
Partitioning of plane sets into
$6$
subsets of small diameter
V. O. Koval'
100
Upper and lower bounds on the height of proofs in sequent calculus for intuitionistic logic
V. P. Orevkov
124
©
Steklov Math. Inst. of RAS
, 2025
