"Every line graph of a 4-edge-connected graph is I-connected."

Hong-Jian Lai, Lianying Miao, Yehong Shao (2009)

> Home

Details and statistics

DOI: 10.1016/J.EJC.2008.02.013

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/ejc/LaiMS09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ejc/LaiMS09
Hong-Jian Lai, Lianying Miao, Yehong Shao:
Every line graph of a 4-edge-connected graph is I-connected. Eur. J. Comb. 30(2): 595-601 (2009)

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.