scientific article; zbMATH DE number 3305794

From MaRDI portal
Revision as of 03:47, 7 March 2024 by Import240305080351 (talk | contribs) (Created automatically from import240305080351)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5587076

zbMath0192.33101MaRDI QIDQ5587076

No author found.

Publication date: 1969


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



Related Items (31)

On Finding Hamiltonian Cycles in Barnette GraphsOn 2-factors splitting an embedded graph into two plane graphsGrünbaum colorings of triangulations on the projective planeThe minimality of the Georges–Kelmans graphOn the number of anchored rectangle packings for a planar point setOn the Number of Anchored Rectangle Packings for a Planar Point SetHamiltonicity of Cubic Planar Graphs with Bounded Face SizesDuality and perfection for edges in cliquesComplexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surfaceA note on Hamiltonian cycles in bipartite plane cubic maps having connectivity 2Enumerating the total colorings of a polyhedron and application to polyhedral linksAnchored rectangle and square packingsGenerating even triangulations on the torusOn Barnette's conjectureHamiltonian circuits in polytopes with even sided facesAlgebraic models for two-edgeconnected graphsOn dispersable book embeddingsColoring plane graphs with independent crossingsOn the complexity of anchored rectangle packingPacking boundary-anchored rectangles and squaresUnnamed ItemSigned diagonal flips and the four color theoremThe reach of axis-aligned squares in the plane3-mapsA problem of BergeOrdered colourings of graphsChords of 2-factors in planar cubic bridgeless graphsSome families of graphs with no nonzero real domination rootsMatching theory and Barnette's conjectureHamiltonian cycles in cubic 3-connected bipartite planar graphsLattice paths not touching a given boundary




This page was built for publication: