Construction of planar 4-connected triangulations
DOI10.26493/1855-3974.459.C4DzbMATH Open1329.05078OpenAlexW1751584115WikidataQ129355204 ScholiaQ129355204MaRDI QIDQ3465653FDOQ3465653
Authors: Gunnar Brinkmann, Craig E. Larson, Jasper Souffriau, Nico Van Cleemput
Publication date: 22 January 2016
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/1855-3974.459.c4d
Recommendations
- Four-connected triangulations of planar point sets
- On triangulating planar graphs under the four-connectivity constraint
- On triangulating planar graphs under the four-connectivity constraint
- 4-connected triangulations on few lines
- 4-connected triangulations on few lines
- 4-connected triangulations and 4-orderedness
- Generating 4-connected even triangulations on the sphere
- Construction of acyclically 4-colourable planar triangulations with minimum degree 4
- Construction of 4-Regular Graphs
- Generating the 4-connected and strongly 4-connected triangulations on the torus and projective plane
Planar graphs; geometric and topological aspects of graph theory (05C10) Enumeration in graph theory (05C30) Structural characterization of families of graphs (05C75)
Cited In (7)
- Minimal \(k\)-connected non-Hamiltonian graphs
- Title not available (Why is that?)
- 4-connected triangulations and 4-orderedness
- On triangulating planar graphs under the four-connectivity constraint
- The construction of 4-regular polyhedra containing triangles, quadrilaterals and pentagons
- Circumference of essentially 4-connected planar triangulations
- Vertex splitting, coincident realisations, and global rigidity of braced triangulations
This page was built for publication: Construction of planar 4-connected triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3465653)