Jochen Harant

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◁ ▶ single authored publications

> Home > Persons > Jochen Harant

Publications

2013
[j47]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dmgt/Harant13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dmgt/Harant13
Jochen Harant:
A note on Barnette's Conjecture. Discuss. Math. Graph Theory 33(1): 133-137 (2013)
2011
[j42]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dam/Harant11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/Harant11
Jochen Harant:
A lower bound on independence in terms of degrees. Discret. Appl. Math. 159(10): 966-970 (2011)
2010
[c2]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - conf/colognetwente/Harant10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/colognetwente/Harant10
Jochen Harant:
On Hamiltonian Cycles through Prescribed Edges of a Planar Graph. CTW 2010: 79-82
2004
[j22]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/Harant04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/Harant04
Jochen Harant:
On paths and cycles through specified vertices. Discret. Math. 286(1-2): 95-98 (2004)
2000
[j14]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dmgt/Harant00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dmgt/Harant00
Jochen Harant:
Some news about the independence number of a graph. Discuss. Math. Graph Theory 20(1): 71-79 (2000)
1998
[j9]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/Harant98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/Harant98
Jochen Harant:
A lower bound on the independence number of a graph. Discret. Math. 188(1-3): 239-243 (1998)
1993
[j3]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/Harant93
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/Harant93
Jochen Harant:
Toughness and nonhamiltonicity of polyhedral graphs. Discret. Math. 113(1-3): 249-253 (1993)
[j2]
- view
  - electronic edition via DOI (open access)
  - references & citations
  authority control:
- export record
  dblp key:
  - journals/dm/Harant93a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dm/Harant93a
Jochen Harant:
An upper bound for the radius of a 3-connected graph. Discret. Math. 122(1-3): 335-341 (1993)

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.