scientific article; zbMATH DE number 3217679

zbMATH Open0134.19601MaRDI QIDQ5344765FDOQ5344765

Authors: Anton Kotzig 

Publication date: 1963

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

Title of this publication is not available (Why is that?)

zbMATH Keywords

topology

Cited In (48)

• Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers
• Combinatorial structure of faces in triangulated 3-polytopes with minimum degree 4
• Low minor faces in 3-polytopes
• Light \(C_4\) and \(C_5\) in 3-polytopes with minimum degree 5
• Extending two theorems of A. Kotzig
• Title not available (Why is that?)
• Low edges in 3-polytopes
• The height of faces of 3-polytopes
• Structural Properties of Planar Maps with the Minimal Degree 5
• Tight description of faces of triangulations on the torus
• Height of minor faces in plane normal maps
• An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations
• Low faces of restricted degree in 3-polytopes
• Heights of minor faces in 3-polytopes
• Title not available (Why is that?)
• Triangles with restricted degree sum of their boundary vertices in plane graphs
• Paths with restricted degrees of their vertices in planar graphs
• Solution of problems of Kotzig and Grünbaum concerning the isolation of cycles in planar graphs
• The vertex-face weight of edges in 3-polytopes
• Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces
• The weight of faces in normal plane maps
• On quadrangular convex 3-polytopes with at most two types of edges
• Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11
• Describing 3-faces in normal plane maps with minimum degree 4
• Describing faces in plane triangulations
• Tight description of faces in torus triangulations with minimum degree 5
• Describing neighborhoods of 5-vertices in a class of 3-polytopes with minimum degree 5
• On Light Edges and Triangles in Planar Graphs of Minimum Degree Five
• Another tight description of faces in plane triangulations with minimum degree 4
• Combinatorial structure of faces in triangulations on surfaces
• On the weight of minor faces in triangle-free 3-polytopes
• Describing faces in 3-polytopes with no vertices of degree from 5 to 7
• A Steinberg-like approach to describing faces in 3-polytopes
• Describing neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and without vertices of degrees from 7 to 11
• On light cycles in plane triangulations
• An extension of Kotzig's theorem
• The method of coloring in graphs and its application
• Triangulated \(3\)-polytopes without faces of low weight
• Joint extension of two theorems of Kotzig on 3-polytopes
• Note on inscribability of quadrangular polyhedra with restricted number of edge-types
• The game coloring number of planar graphs
• Heights of minor faces in triangle-free 3-polytopes
• Lightness of digraphs in surfaces and directed game chromatic number
• 5-stars of low weight in normal plane maps with minimum degree 5
• On a problem of J. Zaks concerning 5-valent 3-connected planar graphs
• Convex 3-polytopes with exactly two types of edges
• k-valent maps on the surfaces
• More about the height of faces in 3-polytopes

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5344765)