The following pages link to Edge weights and vertex colours (Q1826962):
Displayed 50 items.
- A note on adjacent vertex distinguishing colorings of graphs (Q266908) (← links)
- Group sum chromatic number of graphs (Q268265) (← links)
- Total edge irregularity strength of generalized prism (Q272396) (← links)
- Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic (Q281776) (← links)
- On decomposing graphs of large minimum degree into locally irregular subgraphs (Q286116) (← links)
- Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz (Q287913) (← links)
- Total weight choosability of cone graphs (Q293660) (← links)
- The 1,2-conjecture for powers of cycles (Q324730) (← 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)
- Decomposing graphs into a constant number of locally irregular subgraphs (Q338587) (← links)
- Decomposing oriented graphs into six locally irregular oriented graphs (Q343709) (← links)
- Essential positive covers of the cube (Q385027) (← links)
- Algorithmic complexity of proper labeling problems (Q391137) (← links)
- Distant irregularity strength of graphs (Q394284) (← 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)
- The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs (Q472134) (← links)
- A note on vertex colorings of plane graphs (Q472144) (← links)
- Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz (Q477256) (← links)
- An improved upper bound on edge weight choosability of graphs (Q497381) (← links)
- Neighbor sum distinguishing total colorings of planar graphs (Q498443) (← links)
- Adjacent vertex distinguishing colorings by sum of sparse graphs (Q501028) (← links)
- Vertex coloring of graphs by total 2-weightings (Q503639) (← links)
- A note on neighbor expanded sum distinguishing index (Q505462) (← links)
- Permanent index of matrices associated with graphs (Q510339) (← links)
- Total weight choosability of Mycielski graphs (Q512875) (← links)
- Neighbor product distinguishing total colorings (Q512884) (← links)
- Graphs with multiplicative vertex-coloring 2-edge-weightings (Q512893) (← links)
- On a directed variation of the 1-2-3 and 1-2 conjectures (Q516801) (← links)
- On weight choosabilities of graphs with bounded maximum average degree (Q516900) (← 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)
- Neighbor sum distinguishing total coloring of graphs with bounded treewidth (Q724731) (← links)
- On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs (Q730489) (← links)
- Additive coloring of planar graphs (Q742621) (← links)
- Coloring chip configurations on graphs and digraphs (Q763476) (← links)
- 1-2-3 Conjecture in digraphs: more results and directions (Q777370) (← links)
- Vertex colouring edge weightings: a logarithmic upper bound on weight-choosability (Q831336) (← links)
- On the neighbor sum distinguishing total coloring of planar graphs (Q897872) (← links)
- Thue type problems for graphs, points, and numbers (Q941381) (← links)
- Edge colouring by total labellings (Q960914) (← links)
- Total edge irregularity strength of complete graphs and complete bipartite graphs (Q960943) (← links)
- 1,2 conjecture-the multiplicative version (Q963408) (← links)
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture (Q965260) (← links)