Pages that link to "Item:Q607360"
From MaRDI portal
The following pages link to Vertex-coloring 2-edge-weighting of graphs (Q607360):
Displaying 39 items.
- Group sum chromatic number of graphs (Q268265) (← 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)
- Total weight choosability of Cartesian product of graphs (Q449198) (← links)
- A note on vertex colorings of plane graphs (Q472144) (← links)
- Vertex coloring of graphs by total 2-weightings (Q503639) (← links)
- Permanent index of matrices associated with graphs (Q510339) (← links)
- Graphs with multiplicative vertex-coloring 2-edge-weightings (Q512893) (← links)
- Vertex-coloring 2-edge-weighting of graphs (Q607360) (← links)
- Vertex-coloring edge-weightings of graphs (Q647275) (← links)
- On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs (Q730489) (← links)
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture (Q965260) (← links)
- On vertex-coloring 13-edge-weighting (Q1001315) (← links)
- Models and heuristic algorithms for a weighted vertex coloring problem (Q1038841) (← links)
- (Q1042546) (redirect page) (← links)
- A note on edge weightings inducing proper vertex colorings (Q1756095) (← links)
- Equitable neighbour-sum-distinguishing edge and total colourings (Q1786869) (← links)
- Edge weights and vertex colours (Q1826962) (← links)
- On total weight choosability of graphs (Q1956254) (← links)
- On \(\{a, b\}\)-edge-weightings of bipartite graphs with odd \(a, b\) (Q2062679) (← links)
- On proper labellings of graphs with minimum label sum (Q2118389) (← links)
- Neighbour-distinguishing labellings of families of graphs (Q2141099) (← links)
- Neighbour-distinguishing labellings of powers of paths and powers of cycles (Q2175048) (← links)
- Vertex coloring edge-weighted digraphs (Q2348711) (← links)
- Vertex-coloring 3-edge-weighting of some graphs (Q2374171) (← links)
- Vertex-colouring edge-weightings (Q2466341) (← links)
- A relaxed case on 1-2-3 conjecture (Q2631083) (← links)
- An injective version of the 1-2-3 conjecture (Q2657086) (← links)
- On vertex-weighted graph realizations (Q2692719) (← links)
- (Q3115650) (← links)
- (Q3475285) (← links)
- Edge Coloring and Decompositions of Weighted Graphs (Q3541103) (← links)
- Total weight choosability for Halin graphs (Q4958040) (← links)
- (Q5164968) (← links)
- A NEW VERTEX-COLORING EDGE-WEIGHTING OF COMPLETE GRAPHS (Q5407149) (← links)
- Vertex-coloring graphs with 4-edge-weightings (Q6081387) (← links)
- On the total versions of 1-2-3-conjecture for graphs and hypergraphs (Q6103468) (← links)
- Neighbour sum distinguishing edge-weightings with local constraints (Q6103480) (← links)
- Adding direction constraints to the 1-2-3 conjecture (Q6652479) (← links)
