Publication date
January 1993
DOI Publisher
Institute of Mathematics, Czech Academy of Sciences Language
EnglishAbstract
summary:A distance between finite partially ordered sets is studied. It is a certain measure of the difference of their structure
summary:A distance between finite partially ordered sets is studied. It is a certain measure of the difference of their structure
summary:If $A$ is a class of partially ordered sets, let $P(A)$ denote the system of all posets whic...
AbstractIn this paper, we show that if a partially ordered set has 2n elements and has dimension n, ...
Abstract. We use a variety of combinatorial techniques to prove several theorems concerning fraction...
summary:A distance between finite partially ordered sets is studied. It is a certain measure of the ...
summary:A distance between finite partially ordered sets is studied. It is a certain measure of the ...
summary:Discrete partially ordered sets can be turned into distance spaces in several ways. The dist...
AbstractChatrand et al. [Graph similarity and distance in graphs, Aequationes Math. 55 (1998) 129–14...
summary:Discrete partially ordered sets can be turned into distance spaces in several ways. The dist...
summary:In [3] a metric on a system of isomorphism classes of ordered sets was defined. In this pape...
summary:In [3] a metric on a system of isomorphism classes of ordered sets was defined. In this pape...
Discrete partially ordered sets can be turned into distance spaces in several ways. The distance fun...
AbstractWe use a variety of combinatorial techniques to prove several theorems concerning fractional...
AbstractWe use a variety of combinatorial techniques to prove several theorems concerning fractional...
For every connected graph G, a subgraph H of G is isometric if the distance between any two vertices...
summary:If $A$ is a class of partially ordered sets, let $P(A)$ denote the system of all posets whic...
summary:If $A$ is a class of partially ordered sets, let $P(A)$ denote the system of all posets whic...
AbstractIn this paper, we show that if a partially ordered set has 2n elements and has dimension n, ...
Abstract. We use a variety of combinatorial techniques to prove several theorems concerning fraction...
summary:A distance between finite partially ordered sets is studied. It is a certain measure of the ...
summary:A distance between finite partially ordered sets is studied. It is a certain measure of the ...
summary:Discrete partially ordered sets can be turned into distance spaces in several ways. The dist...
AbstractChatrand et al. [Graph similarity and distance in graphs, Aequationes Math. 55 (1998) 129–14...
summary:Discrete partially ordered sets can be turned into distance spaces in several ways. The dist...
summary:In [3] a metric on a system of isomorphism classes of ordered sets was defined. In this pape...
summary:In [3] a metric on a system of isomorphism classes of ordered sets was defined. In this pape...
Discrete partially ordered sets can be turned into distance spaces in several ways. The distance fun...
AbstractWe use a variety of combinatorial techniques to prove several theorems concerning fractional...
AbstractWe use a variety of combinatorial techniques to prove several theorems concerning fractional...
For every connected graph G, a subgraph H of G is isometric if the distance between any two vertices...
summary:If $A$ is a class of partially ordered sets, let $P(A)$ denote the system of all posets whic...
summary:If $A$ is a class of partially ordered sets, let $P(A)$ denote the system of all posets whic...
AbstractIn this paper, we show that if a partially ordered set has 2n elements and has dimension n, ...
Abstract. We use a variety of combinatorial techniques to prove several theorems concerning fraction...
Add to ORKG