scientific article

zbMath1439.05057MaRDI QIDQ3305178

Pilar Valencia Saravia, Mika Olsen, Lorena Armas-Sanabria

Publication date: 6 August 2020

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

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

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

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph minors. XX: Wagner's conjecture
• On embeddings of snarks in the torus
• Families of dot-product snarks on orientable surfaces of low genus
• The book thickness of a graph
• Construction of class two graphs with maximum vertex degree three
• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• The pagenumber of toroidal graphs is at most seven
• On Polyhedral Embeddings of Cubic Graphs
• Polyhedral embeddings of snarks in orientable surfaces
• Decomposition of snarks
• The NP-Completeness of Edge-Coloring
• Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
• Blocks and the nonorientable genus of graphs
• A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
• Genus g Graphs Have Pagenumber O(√g)
• Decompositions and reductions of snarks
• Relating embedding and coloring properties of snarks
• Additivity of the genus of a graph
• Polyhedral decompositions of cubic graphs
• Network-Colourings