Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
scientific article; zbMATH DE number 3217679 - MaRDI portal

scientific article; zbMATH DE number 3217679

From MaRDI portal
Publication:5344765

zbMath0134.19601MaRDI QIDQ5344765

Anton Kotzig

Publication date: 1963

Full work available at URL: https://eudml.org/doc/29940

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (48)

Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and facesEdge-partitions of graphs of nonnegative characteristic and their game coloring numbersThe height of faces of 3-polytopesPaths with restricted degrees of their vertices in planar graphsA Steinberg-like approach to describing faces in 3-polytopesJoint extension of two theorems of Kotzig on 3-polytopesThe weight of faces in normal plane mapsTriangles with restricted degree sum of their boundary vertices in plane graphsAnother tight description of faces in plane triangulations with minimum degree 4Describing neighborhoods of 5-vertices in a class of 3-polytopes with minimum degree 5Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11An extension of Kotzig's theoremCombinatorial structure of faces in triangulations on surfacesHeights of minor faces in 3-polytopesStructural Properties of Planar Maps with the Minimal Degree 5Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11Describing 3-faces in normal plane maps with minimum degree 4Describing faces in plane triangulationsLight \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5On Light Edges and Triangles in Planar Graphs of Minimum Degree FiveTight description of faces of triangulations on the torusUnnamed ItemThe vertex-face weight of edges in 3-polytopesThe method of coloring in graphs and its applicationMore about the height of faces in 3-polytopesConvex 3-polytopes with exactly two types of edgesCombinatorial structure of faces in triangulated 3-polytopes with minimum degree 4Note on inscribability of quadrangular polyhedra with restricted number of edge-typesAn improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulationsOn quadrangular convex 3-polytopes with at most two types of edgesOn the weight of minor faces in triangle-free 3-polytopes5-stars of low weight in normal plane maps with minimum degree 5Heights of minor faces in triangle-free 3-polytopesLow edges in 3-polytopesLow minor faces in 3-polytopesSolution of problems of Kotzig and Grünbaum concerning the isolation of cycles in planar graphsTight description of faces in torus triangulations with minimum degree 5Unnamed ItemLightness of digraphs in surfaces and directed game chromatic numberDescribing faces in 3-polytopes with no vertices of degree from 5 to 7Extending two theorems of A. KotzigOn light cycles in plane triangulationsLow faces of restricted degree in 3-polytopesTriangulated \(3\)-polytopes without faces of low weightOn a problem of J. Zaks concerning 5-valent 3-connected planar graphsThe game coloring number of planar graphsk-valent maps on the surfacesHeight of minor faces in plane normal maps




This page was built for publication: