Pages that link to "Item:Q814092"

The following pages link to Remarks on the thickness and outerthickness of a graph (Q814092):

Displaying 15 items.

• An annotated bibliography on the thickness, outerthickness, and arboricity of a graph (Q263943) (← links)
• The complexity of the empire colouring problem (Q476435) (← links)
• Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs (Q1043806) (← links)
• Remarks on the thickness of a graph (Q1292575) (← links)
• Thickness and outerthickness for embedded graphs (Q1744754) (← links)
• A simulated annealing algorithm for determining the thickness of a graph (Q2568255) (← links)
• (Q3356315) (← links)
• The outerthickness \&{} outercoarseness of graphs. I: The complete graph \&{} the \(n\)-cube (Q3972003) (← links)
• (Q4503094) (← links)
• A note on the thickness of some complete bipartite graphs (Q4577871) (← links)
• Thickness and Antithickness of Graphs (Q4626298) (← links)
• Remarks on the thickness of K_n,n,n (Q5357294) (← links)
• Thickness and connectivity in graphs (Q5548827) (← links)
• A note on fold thickness of graphs (Q6113543) (← links)
• The thickness of some complete bipartite and tripartite graphs (Q6639490) (← links)