scientific article; zbMATH DE number 7228873

MaRDI QIDQ3305178zbMATH OpenFDO

Authors Lorena Armas-Sanabria, M. Olsen, Pilar Valencia Saravia

Publication date 6 August 2020

Full work available at URL https://miscelaneamatematica.org/welcome/default/download/tbl_articulos.pdf2.99a2a7a5384185f3.353530362e706466.pdf

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83)

Cites work

• A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
• Additivity of the genus of a graph
• Blocks and the nonorientable genus of graphs
• Construction of class two graphs with maximum vertex degree three
• Decomposition of snarks
• Decompositions and reductions of snarks
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Families of dot-product snarks on orientable surfaces of low genus
• Genus g Graphs Have Pagenumber O(√g)
• Graph minors. XX: Wagner's conjecture
• Graph theory
• Graphs on surfaces
• scientific article; zbMATH DE number 3889544 (Why is no real title available?)
• scientific article; zbMATH DE number 3937197 (Why is no real title available?)
• scientific article; zbMATH DE number 3708283 (Why is no real title available?)
• scientific article; zbMATH DE number 3754754 (Why is no real title available?)
• scientific article; zbMATH DE number 1156577 (Why is no real title available?)
• scientific article; zbMATH DE number 3450230 (Why is no real title available?)
• scientific article; zbMATH DE number 867669 (Why is no real title available?)
• scientific article; zbMATH DE number 867711 (Why is no real title available?)
• scientific article; zbMATH DE number 3246034 (Why is no real title available?)
• scientific article; zbMATH DE number 3102311 (Why is no real title available?)
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Network-Colourings
• On embeddings of snarks in the torus
• On Polyhedral Embeddings of Cubic Graphs
• Polyhedral decompositions of cubic graphs
• Polyhedral embeddings of snarks in orientable surfaces
• Relating embedding and coloring properties of snarks
• Snarks and reducibility
• The book thickness of a graph
• The NP-Completeness of Edge-Coloring
• The pagenumber of toroidal graphs is at most seven

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 Q3305178)