Graphs with multiplicative vertex-coloring 2-edge-weightings
Author
Abstract
Suggested Citation
DOI: 10.1007/s10878-015-9966-7
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Haiying Wang, 2007. "On the adjacent vertex-distinguishing total chromatic numbers of the graphs with Δ (G) = 3," Journal of Combinatorial Optimization, Springer, vol. 14(1), pages 87-109, July.
- Hervé Hocquard & Mickaël Montassier, 2013. "Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ," Journal of Combinatorial Optimization, Springer, vol. 26(1), pages 152-160, July.
- Weifan Wang & Yiqiao Wang, 2010. "Adjacent vertex distinguishing edge-colorings of graphs with smaller maximum average degree," Journal of Combinatorial Optimization, Springer, vol. 19(4), pages 471-485, May.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Yi Wang & Jian Cheng & Rong Luo & Gregory Mulley, 2016. "Adjacent vertex-distinguishing edge coloring of 2-degenerate graphs," Journal of Combinatorial Optimization, Springer, vol. 31(2), pages 874-880, February.
- Junlei Zhu & Yuehua Bu & Yun Dai, 2018. "Upper bounds for adjacent vertex-distinguishing edge coloring," Journal of Combinatorial Optimization, Springer, vol. 35(2), pages 454-462, February.
- Enqiang Zhu & Chanjuan Liu & Jiguo Yu, 2020. "Neighbor product distinguishing total colorings of 2-degenerate graphs," Journal of Combinatorial Optimization, Springer, vol. 39(1), pages 72-76, January.
- Jingjing Huo & Yiqiao Wang & Weifan Wang, 2017. "Neighbor-sum-distinguishing edge choosability of subcubic graphs," Journal of Combinatorial Optimization, Springer, vol. 34(3), pages 742-759, October.
- Huijuan Wang & Lidong Wu & Weili Wu & Jianliang Wu, 2014. "Minimum number of disjoint linear forests covering a planar graph," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 274-287, July.
- Xiaohan Cheng & Jianliang Wu, 2018. "The adjacent vertex distinguishing total choosability of planar graphs with maximum degree at least eleven," Journal of Combinatorial Optimization, Springer, vol. 35(1), pages 1-13, January.
- Chengchao Yan & Danjun Huang & Dong Chen & Weifan Wang, 2014. "Adjacent vertex distinguishing edge colorings of planar graphs with girth at least five," Journal of Combinatorial Optimization, Springer, vol. 28(4), pages 893-909, November.
- Zhuoya Liu & Changqing Xu, 2022. "Adjacent vertex distinguishing edge coloring of IC-planar graphs," Journal of Combinatorial Optimization, Springer, vol. 43(4), pages 710-726, May.
- Zengtai Gong & Chen Zhang, 2023. "Adjacent Vertex Distinguishing Coloring of Fuzzy Graphs," Mathematics, MDPI, vol. 11(10), pages 1-25, May.
- Hervé Hocquard & Mickaël Montassier, 2013. "Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ," Journal of Combinatorial Optimization, Springer, vol. 26(1), pages 152-160, July.
More about this item
Keywords
Edge weighting; Vertex coloring; 1-2-3 Conjecture;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:33:y:2017:i:1:d:10.1007_s10878-015-9966-7. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.