"Alternating walks in partially 2-edge-colored graphs and optimal strength ..."

André E. Kézdy, Chi Wang (1999)

> Home

Details and statistics

DOI: 10.1016/S0012-365X(98)00148-4

access: open

type: Journal Article

metadata version: 2022-06-23

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/dm/KezdyW99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/KezdyW99
André E. Kézdy, Chi Wang:
Alternating walks in partially 2-edge-colored graphs and optimal strength of graph labeling. Discret. Math. 194(1-3): 261-265 (1999)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.