Multiplicative vertex-colouring weightings of graphs
From MaRDI portal
Publication:413281
DOI10.1016/J.IPL.2011.11.009zbMATH Open1239.05085OpenAlexW2003590334MaRDI QIDQ413281FDOQ413281
Publication date: 4 May 2012
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2011.11.009
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)
Cites Work
- Edge weights and vertex colours
- Vertex-colouring edge-weightings
- Title not available (Why is that?)
- On irregular total labellings
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Lucky labelings of graphs
- Vertex colouring edge partitions
- Adjacent Vertex Distinguishing Edge‐Colorings
- Title not available (Why is that?)
- 1,2 conjecture-the multiplicative version
- How to Increase Robustness of Capable-to-Promise
Cited In (11)
- A proof of the multiplicative 1-2-3 conjecture
- Further evidence towards the multiplicative 1-2-3 conjecture
- On a list variant of the multiplicative 1-2-3 conjecture
- Algorithmic complexity of proper labeling problems
- Gap vertex-distinguishing edge colorings of graphs
- Graphs with multiplicative vertex-coloring 2-edge-weightings
- Product irregularity strength of graphs with small clique cover number
- Neighbor product distinguishing total colorings of 2-degenerate graphs
- Title not available (Why is that?)
- Neighbor product distinguishing total colorings
- A relaxed case on 1-2-3 conjecture
This page was built for publication: Multiplicative vertex-colouring weightings of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q413281)
