Pages that link to "Item:Q1313849"
From MaRDI portal
The following pages link to Incidence and strong edge colorings of graphs (Q1313849):
Displayed 44 items.
- Clique number of the square of a line graph (Q271628) (← links)
- Incidence coloring on hypercubes (Q300251) (← links)
- On incidence coloring conjecture in Cartesian products of graphs (Q313802) (← links)
- The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs (Q318921) (← links)
- On the adjacent vertex-distinguishing equitable edge coloring of graphs (Q385210) (← links)
- Induced matchings in subcubic graphs without short cycles (Q393187) (← links)
- Strong edge-coloring for cubic Halin graphs (Q408187) (← links)
- The strong chromatic index of sparse graphs (Q477679) (← links)
- Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs (Q501082) (← links)
- The strong chromatic index of \((3,\Delta)\)-bipartite graphs (Q512620) (← links)
- Interval incidence coloring of subcubic graphs (Q521761) (← links)
- Fractional strong chromatic index of bipartite graphs (Q526231) (← links)
- The incidence game chromatic number of paths and subgraphs of wheels (Q534326) (← links)
- Incidence coloring of pseudo-Halin graphs (Q713146) (← links)
- A note on the strong chromatic index of bipartite graphs (Q932702) (← links)
- The strong chromatic index of a class of graphs (Q998363) (← links)
- Incidence coloring of the squares of some graphs (Q998397) (← links)
- Invalid proofs on incidence coloring (Q998399) (← links)
- Some results on the incidence coloring number of a graph (Q1043553) (← links)
- On incidence coloring and star arboricity of graphs (Q1356555) (← links)
- Facial incidence colorings of embedded multigraphs (Q1630925) (← links)
- Oriented incidence colourings of digraphs (Q1630937) (← links)
- Strong chromatic index of graphs with maximum degree four (Q1671652) (← links)
- On incidence coloring of complete multipartite and semicubic bipartite graphs (Q1692634) (← links)
- The incidence coloring conjecture for graphs of maximum degree 3 (Q1773364) (← links)
- The incidence coloring numbers of meshes (Q1779599) (← links)
- Incidence coloring of \(k\)-degenerated graphs (Q1827780) (← links)
- Reconstructing a graph from its arc incidence graph (Q1926018) (← links)
- On incidence choosability of cubic graphs (Q1999751) (← links)
- The incidence game chromatic number of \((a,d)\)-decomposable graphs (Q2018537) (← links)
- Interval incidence graph coloring (Q2255045) (← links)
- Incidence choosability of graphs (Q2312648) (← links)
- Incidence coloring of Cartesian product graphs (Q2348706) (← links)
- Incidence coloring of graphs with high maximum average degree (Q2357131) (← links)
- Note on incidence chromatic number of subquartic graphs (Q2410036) (← links)
- NP-completeness of 4-incidence colorability of semi-cubic graphs (Q2470012) (← links)
- Strong edge-coloring for jellyfish graphs (Q2515576) (← links)
- Interval incidence coloring of bipartite graphs (Q2636801) (← links)
- A Note on Incidence graphs (Q2839242) (← links)
- Strong Chromatic Index of Chordless Graphs (Q2947859) (← links)
- Strong Chromatic Index of 2-Degenerate Graphs (Q4920654) (← links)
- Recent progress on strong edge-coloring of graphs (Q5242836) (← links)
- The incidence game chromatic number (Q5899386) (← links)
- The incidence game chromatic number (Q5902114) (← links)