Zap. Nauchn. Sem. POMI, 2011, Volume 391

RUS ENG

JOURNALS // Zapiski Nauchnykh Seminarov POMI // Archive

2011, Volume 391

|

General information

|

Contents

|

Combinatorics and graph theory. Part III

	Bounds of a number of leaves of spanning trees in graphs without triangles Bankevich A. V.		5
	Bounds of a number of leaves of spanning trees A. V. Bankevich, D. V. Karpov		18
	On graphs with a large chromatic number containing no small odd cycles S. L. Berlov, I. I. Bogdanov		35
	Generalized flowers in $k$-connected graph A. L. Glazman		45
	On proper colorings of hypergraphs N. V. Gravin, D. V. Karpov		79
	The structure of decomposition of a triconnected graph D. V. Karpov, A. V. Pastor		90
	An upper bound on the chromatic number of circle graphs without $K_4$ G. V. Nenashev		149
	Local structure of 9 and 10-connected graphs S. A. Obraztsova		157
	About vertices of degree $k$ of minimally and contraction critically $k$-connected graphs: upper bounds S. A. Obraztsova, A. V. Pastor		198

© Steklov Math. Inst. of RAS, 2026