Pages that link to "Item:Q1001315"
From MaRDI portal
The following pages link to On vertex-coloring 13-edge-weighting (Q1001315):
Displayed 22 items.
- A note on adjacent vertex distinguishing colorings of graphs (Q266908) (← links)
- Group sum chromatic number of graphs (Q268265) (← links)
- The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture (Q326818) (← links)
- The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs (Q472134) (← links)
- A note on vertex colorings of plane graphs (Q472144) (← links)
- Total weight choosability of Mycielski graphs (Q512875) (← links)
- Vertex-coloring 2-edge-weighting of graphs (Q607360) (← links)
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture (Q965260) (← links)
- Distant sum distinguishing index of graphs (Q2012525) (← links)
- On decomposing regular graphs into locally irregular subgraphs (Q2349960) (← links)
- Vertex-coloring 3-edge-weighting of some graphs (Q2374171) (← links)
- The edge-labeling and vertex-colors of \(K_n\) (Q2391759) (← links)
- Total weight choosability of graphs with bounded maximum average degree (Q2397545) (← links)
- Distant irregularity strength of graphs with bounded minimum degree (Q2410259) (← links)
- A note on face coloring entire weightings of plane graphs (Q2450136) (← links)
- Weak and strong versions of the 1-2-3 conjecture for uniform hypergraphs (Q2629488) (← links)
- A relaxed case on 1-2-3 conjecture (Q2631083) (← links)
- Neighbor sum distinguishing index of \(K_4\)-minor free graphs (Q2631098) (← links)
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree (Q2636830) (← links)
- NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS (Q4903632) (← links)
- On the Neighbor Sum Distinguishing Index of Planar Graphs (Q4978296) (← links)
- Total Weight Choosability of Trees (Q5346547) (← links)