"On Minimum Degree Implying That a Graph is H-Linked."

Ronald J. Gould, Alexandr V. Kostochka, Gexin Yu (2006)

> Home

Details and statistics

DOI: 10.1137/050624662

access: closed

type: Journal Article

metadata version: 2020-04-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamdm/GouldKY06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamdm/GouldKY06
Ronald J. Gould, Alexandr V. Kostochka, Gexin Yu:
On Minimum Degree Implying That a Graph is H-Linked. SIAM J. Discret. Math. 20(4): 829-840 (2006)

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.