scientific article; zbMATH DE number 3305794
From MaRDI portal
Publication:5587076
Cited in
(40)- 3-maps
- Ordered colourings of graphs
- Combinatoire énumérative. Proceedings of the Colloque de combinatoire énumérative (Colloquium on Enumerative Combinatorics), held at Université du Québec à Montréal (Canada), May 28 - June 1, 1985
- A note on Hamiltonian cycles in bipartite plane cubic maps having connectivity 2
- Hamiltonian circuits in polytopes with even sided faces
- Algebraic models for two-edgeconnected graphs
- Lattice paths not touching a given boundary
- Anchored rectangle and square packings
- Generating even triangulations on the torus
- Signed diagonal flips and the four color theorem
- Chords of 2-factors in planar cubic bridgeless graphs
- Matching theory and Barnette's conjecture
- On 2-factors splitting an embedded graph into two plane graphs
- Packing boundary-anchored rectangles and squares
- Coloring plane graphs with independent crossings
- On the number of anchored rectangle packings for a planar point set
- Grünbaum colorings of triangulations on the projective plane
- On the number of anchored rectangle packings for a planar point set
- Advances in Combinatorial Mathematics
- Enumerating the total colorings of a polyhedron and application to polyhedral links
- Some families of graphs with no nonzero real domination roots
- The minimality of the Georges-Kelmans graph
- On the complexity of anchored rectangle packing
- Hamiltonicity of cubic planar graphs with bounded face sizes
- scientific article; zbMATH DE number 7068502 (Why is no real title available?)
- On Finding Hamiltonian Cycles in Barnette Graphs
- Duality and perfection for edges in cliques
- Complexity of 3-edge-coloring in the class of cubic graphs with a polyhedral embedding in an orientable surface
- Construction of toroidal polyhedra corresponding to perfect chains of isosceles tetrahedra
- Another Hamiltonian cycle in bipartite Pfaffian graphs
- The four color theorem and its aftermath
- A sufficient condition for cubic 3-connected plane bipartite graphs to be Hamiltonian
- Simplicial surfaces with given automorphism group
- On the structure of Hamiltonian graphs with small independence number
- On partial order of -choosability for planar graphs
- On greedily packing anchored rectangles
- The reach of axis-aligned squares in the plane
- A problem of Berge
- Hamiltonian cycles in cubic 3-connected bipartite planar graphs
- On Barnette's conjecture
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 Q5587076)
