scientific article; zbMATH DE number 3346402
From MaRDI portal
zbMath0218.05076MaRDI QIDQ5622228
Publication date: 1971
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Planar drawings with few slopes of Halin graphs and nested pseudotrees, A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph, Drawing Halin-graphs with small height, On Halin subgraphs and supergraphs, Steiner problem in Halin networks, Extremal Halin graphs with respect to the signless Laplacian spectra, VPG and EPG bend-numbers of Halin graphs, Computing straight-line 3D grid drawings of graphs in linear volume, On two-connected subgraph polytopes, Optimal point-set embedding of wheel graphs and a sub-class of 3-trees, Expansion of gene clusters, circular orders, and the shortest Hamiltonian path problem, The binding number of Halin graphs, Plane Triangulations Without a Spanning Halin Subgraph II, Critical vertices in \(k\)-connected digraphs, Treetopes and their graphs, AVDTC numbers of generalized Halin graphs with maximum degree at least 6, A Möbius-invariant power diagram and its applications to soap bubbles and planar Lombardi drawing, Dominating cycles in Halin graphs, On cycle cones and polyhedra, Track layouts, layered path decompositions, and leveled planarity, On orienting graphs for connectivity: Projective planes and Halin graphs, Some structural properties of minimally contraction-critically 5-connected graphs, On the Steiner 2-edge connected subgraph polytope, Graph theory, Incidence coloring of the squares of some graphs, Characterizing the difference between graph classes defined by forbidden pairs including the claw, Cubic graphs that cannot be covered with four perfect matchings, A note on the total chromatic number of Halin graphs with maximum degree 4, Boxicity of Halin graphs, Incidence choosability of graphs, Dirac's Condition for Spanning Halin Subgraphs, Extended formulations for convex hulls of some bilinear functions, Plane Triangulations Without a Spanning Halin Subgraph: Counterexamples to the Lovász--Plummer Conjecture on Halin Graphs, On Rall's 1/2-conjecture on the domination game
