The following pages link to Vertex colouring edge partitions (Q2485946):
Displaying 50 items.
- On decomposing graphs of large minimum degree into locally irregular subgraphs (Q286116) (← links)
- The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture (Q326818) (← links)
- Graphs with vertex-coloring and detectable 2-edge-weighting (Q334127) (← links)
- Algorithmic complexity of proper labeling problems (Q391137) (← links)
- Can colour-blind distinguish colour palettes? (Q396838) (← links)
- Colour-blind can distinguish colour pallets (Q405211) (← links)
- Computation of lucky number of planar graphs is NP-hard (Q413250) (← links)
- Multiplicative vertex-colouring weightings of graphs (Q413281) (← links)
- Total weight choosability of Cartesian product of graphs (Q449198) (← links)
- Permanent index of matrices associated with graphs (Q510339) (← links)
- Graphs with multiplicative vertex-coloring 2-edge-weightings (Q512893) (← links)
- Every graph is \((2,3)\)-choosable (Q519997) (← links)
- The neighbour-sum-distinguishing edge-colouring game (Q526242) (← links)
- Vertex-coloring 2-edge-weighting of graphs (Q607360) (← links)
- The sigma chromatic number of a graph (Q607685) (← links)
- Vertex partitions of \(r\)-edge-colored graphs (Q933003) (← links)
- Edge colouring by total labellings (Q960914) (← links)
- 1,2 conjecture-the multiplicative version (Q963408) (← links)
- Lucky labelings of graphs (Q989579) (← links)
- A new type of edge-derived vertex coloring (Q1045165) (← links)
- Graphs are \((1, \varDelta + 1)\)-choosable (Q1618249) (← links)
- New bounds for locally irregular chromatic index of bipartite and subcubic graphs (Q1631691) (← links)
- Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable (Q1660241) (← links)
- Distant set distinguishing edge colourings of graphs (Q1686263) (← links)
- Multi-set neighbor distinguishing 3-edge coloring (Q1690251) (← links)
- Distant total sum distinguishing index of graphs (Q1712511) (← links)
- A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs (Q1730218) (← links)
- A note on edge weightings inducing proper vertex colorings (Q1756095) (← links)
- Further evidence towards the multiplicative 1-2-3 conjecture (Q2057599) (← links)
- Neighbour-distinguishing labellings of families of graphs (Q2141099) (← links)
- Dense Eulerian graphs are \((1, 3)\)-choosable (Q2152793) (← links)
- The 1-2-3 conjecture almost holds for regular graphs (Q2222048) (← links)
- On colour-blind distinguishing colour pallets in regular graphs (Q2251135) (← links)
- On the complexity of determining the irregular chromatic index of a graph (Q2253909) (← links)
- An oriented version of the 1-2-3 conjecture (Q2259576) (← links)
- On decomposing regular graphs into locally irregular subgraphs (Q2349960) (← links)
- Vertex-coloring 3-edge-weighting of some graphs (Q2374171) (← links)
- Total weight choosability of graphs with bounded maximum average degree (Q2397545) (← links)
- Colorful edge decomposition of graphs: some polynomial cases (Q2403802) (← links)
- Complexity of the improper twin edge coloring of graphs (Q2409501) (← links)
- A note on breaking small automorphisms in graphs (Q2410241) (← links)
- Degree constrained subgraphs (Q2482112) (← links)
- On twin edge colorings of graphs (Q2509550) (← links)
- A relaxed case on 1-2-3 conjecture (Q2631083) (← links)
- On the standard \((2,2)\)-conjecture (Q2662793) (← links)
- Weight choosability of graphs (Q3608322) (← links)
- Edge-partitions of planar graphs and their game coloring numbers (Q4798121) (← links)
- Total weight choosability for Halin graphs (Q4958040) (← links)
- (Q5267501) (← links)
- Total weight choosability of graphs (Q5894172) (← links)
