Pages that link to "Item:Q1944052"

The following pages link to On edge colorings of \(1\)-planar graphs (Q1944052):

Displaying 44 items.

• On edge colorings of 1-toroidal graphs (Q353624) (← links)
• A linear time algorithm for testing maximal 1-planarity of graphs with a rotation system (Q391976) (← links)
• On edge colorings of 1-planar graphs without adjacent triangles (Q413262) (← links)
• Some sufficient conditions for 1-planar graphs to be class 1 (Q484318) (← links)
• A note on the surviving rate of 1-planar graphs (Q512598) (← links)
• A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five (Q520529) (← links)
• On \((p,1)\)-total labelling of 1-planar graphs (Q651281) (← links)
• List edge and list total coloring of 1-planar graphs (Q692658) (← links)
• Light edges in 3-connected 2-planar graphs with prescribed minimum degree (Q723598) (← links)
• Acyclic edge coloring of triangle-free 1-planar graphs (Q746958) (← links)
• An improved upper bound on the linear 2-arboricity of 1-planar graphs (Q831027) (← links)
• The edge chromatic number of outer-1-planar graphs (Q906489) (← links)
• Neighbor sum distinguishing total coloring of sparse IC-planar graphs (Q1706133) (← links)
• On edge colorings of 1-planar graphs without 5-cycles with two chords (Q1717181) (← links)
• Graph edge coloring: a survey (Q1733850) (← links)
• Light paths and edges in families of outer-1-planar graphs (Q1751428) (← links)
• Light subgraphs in the family of 1-planar graphs with high minimum degree (Q1757981) (← links)
• The structure of plane graphs with independent crossings and its applications to coloring problems (Q1935605) (← links)
• A structure of 1-planar graph and its applications to coloring problems (Q2000562) (← links)
• Acyclic edge coloring of IC-planar graphs (Q2023729) (← links)
• A sufficient condition for an IC-planar graph to be class 1 (Q2053694) (← links)
• 1-planar graphs without 4-cycles or 5-cycles are 5-colorable (Q2115229) (← links)
• Adjacent vertex distinguishing edge coloring of IC-planar graphs (Q2136165) (← links)
• Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24 (Q2219970) (← links)
• On \((p, 1)\)-total labelling of some 1-planar graphs (Q2227112) (← links)
• Light edges in 1-planar graphs of minimum degree 3 (Q2279987) (← links)
• Neighbor sum distinguishing total choosability of IC-planar graphs (Q2282486) (← links)
• Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13 (Q2292143) (← links)
• Light structures in 1-planar graphs with an application to linear 2-arboricity (Q2322876) (← links)
• A matrix approach to hypergraph stable set and coloring problems with its application to storing problem (Q2336703) (← links)
• On total colorings of 1-planar graphs (Q2352360) (← links)
• Total coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent triangles (Q2359808) (← links)
• On total colorings of some special 1-planar graphs (Q2401770) (← links)
• An annotated bibliography on 1-planarity (Q2407041) (← links)
• On the equitable edge-coloring of 1-planar graphs and planar graphs (Q2409529) (← links)
• A note on total colorings of 1-planar graphs (Q2444760) (← links)
• Algorithms for 1-Planar Graphs (Q5001657) (← links)
• $$\textit{\textbf{k}}$$-Planar Graphs (Q5001659) (← links)
• The linear 2-arboricity of 1-planar graphs without 3-cycles (Q5025157) (← links)
• Light edges in 1‐planar graphs (Q6046651) (← links)
• On list \((p, 1)\)-total labellings of special planar graphs and 1-planar graphs (Q6117322) (← links)
• 1-planar graphs with girth at least 6 are (1,1,1,1)-colorable (Q6137013) (← links)
• Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23 (Q6162044) (← links)
• The linear 2-arboricity of IC-planar graphs (Q6166036) (← links)