Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs
type: Item
instance of: scholarly article
title: Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs
zbMATH Open document ID: 1223.05195
author: Ellen Gethner
author: Thom Sulanke
published in: Graphs and Combinatorics
publication date: 2009-12-09T00:00:00Z
Mathematics Subject Classification ID: 05C62
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5644637
zbMATH Keywords: graph theory
zbMATH Keywords: graph coloring
zbMATH Keywords: Structural properties of graphs
describes a project that uses: Groups & Graphs
describes a project that uses: Mathematica
MaRDI profile type: Publication
full work available at URL: s00373-008-0833-5
OpenAlex ID: W1979858320
cites work: Every planar map is four colorable. I: Discharging
cites work: Every planar map is four colorable. II: Reducibility
cites work: Thickness‐two graphs part one: New nine‐critical graphs, permuted layer graphs, and Catlin's graphs
cites work: Every planar graph with nine points has a nonplanar complement
cites work: Q4198056
cites work: Some simplified NP-complete graph problems
cites work: Q3972003
cites work: Q3356315
cites work: Coloring Ordinary Maps, Maps of Empires, and Maps of the Moon
cites work: Haj�s constructions of critical graphs
cites work: Graphs, Algorithms, and Optimization
cites work: 4-critical 4-valent planar graphs constructed with crowns.
cites work: Determining the thickness of graphs is NP-hard
cites work: Q3261867
cites work: Q4340879
cites work: The Non-Biplanar Character of the Complete 9-Graph
cites work: \(E_{11}\) and M theory
cites work: Q4707726
DOI: 10.1007/S00373-008-0833-5
description: scientific article; zbMATH DE number 5644637