-
On the complexity of recognizing Hamming graphs and related classes of graphsImrich, Wilfried ; Klavžar, SandiSource: Seminar on discrete mathematics, Leoben, April 24-26, 1995 (Str. 7)Type of material - conference contributionPublish date - 1995Language - englishCOBISS.SI-ID - 8169732
Author
Imrich, Wilfried |
Klavžar, Sandi
Topics
matematika |
teorija grafov |
Hammingovi grafi |
algoritmi |
prepoznavanje |
izometrične vložitve |
medianski graff |
kvazi-medianski grafi |
mathematics |
graph theory |
Hamming graphs |
algorithms |
recognition |
izometric embeddings |
median graphs |
quasi-median graphs
![loading ... loading ...](themes/default/img/ajax-loading.gif)
Shelf entry
Permalink
- URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year | Impact factor | Edition | Category | Classification | ||||
---|---|---|---|---|---|---|---|---|
JCR | SNIP | JCR | SNIP | JCR | SNIP | JCR | SNIP |
Select the library membership card:
DRS, in which the journal is indexed
Database name | Field | Year |
---|
Links to authors' personal bibliographies | Links to information on researchers in the SICRIS system |
---|---|
Imrich, Wilfried | 11754 |
Klavžar, Sandi | 05949 |
Select pickup location:
Material pickup by post
Notification
Subject headings in COBISS General List of Subject Headings
Select pickup location
Pickup location | Material status | Reservation |
---|
Please wait a moment.