Pages that link to "Item:Q1326890"

The following pages link to Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces (Q1326890):

Displayed 22 items.

• The entire choosability of plane graphs (Q266053) ‎ (← links)
• Weight of edges in normal plane maps (Q271617) ‎ (← links)
• An extension of Kotzig's theorem (Q339478) ‎ (← links)
• Describing \((d-2)\)-stars at \(d\)-vertices, \(d\leq 5\), in normal plane maps (Q383686) ‎ (← links)
• Describing 3-paths in normal plane maps (Q394206) ‎ (← links)
• Entire colouring of plane graphs (Q651038) ‎ (← links)
• Entire coloring of plane graph with maximum degree eleven (Q740657) ‎ (← links)
• Weight of 3-paths in sparse plane graphs (Q888584) ‎ (← links)
• Improved bounds for guarding plane graphs with edges (Q1741583) ‎ (← links)
• On the colorings of outerplanar graphs (Q1910522) ‎ (← links)
• Weight of faces in plane maps (Q1966247) ‎ (← links)
• Plane graphs with \(\Delta = 7\) are entirely 10-colorable (Q2185811) ‎ (← links)
• Refined weight of edges in normal plane maps (Q2401800) ‎ (← links)
• The entire chromatic number of graphs embedded on the torus with large maximum degree (Q2402264) ‎ (← links)
• The entire coloring of series-parallel graphs (Q2577645) ‎ (← links)
• Plane graphs with maximum degree 9 are entirely 11-choosable (Q2629286) ‎ (← links)
• Facial list colourings of plane graphs (Q2629297) ‎ (← links)
• Light 3-stars in sparse plane graphs (Q2633370) ‎ (← links)
• Entire \((\varDelta +2)\)-colorability of plane graphs (Q2637243) ‎ (← links)
• Improved bounds for guarding plane graphs with edges (Q5116478) ‎ (← links)
• Tight Descriptions of 3‐Paths in Normal Plane Maps (Q5272637) ‎ (← links)
• Plane Graphs with Maximum Degree Are Entirely ‐Colorable (Q5325942) ‎ (← links)