AbstractIn this paper, we introduce a new multivalued function L called the line hypergraph. The function L generalizes two classical concepts at once, namely, of the line graph and the dual hypergraph. In terms of this function, proofs of some known theorems on line graphs can be unified and their more general versions can be obtained. Three such theorems are considered here, namely, the Berge theorem describing all hypergraphs with a given line graph G in terms of clique coverings of G (Berge, 1973, p. 400), the Krausz global characterization of line graphs for simple graphs (Krausz, 1943) and the Whitney theorem on isomorphisms of line graphs (Whitney, 1932)
AbstractLet G be a line graph. Orlin determined the clique covering and clique partition numbers cc(...
AbstractLet G be a line graph. Orlin determined the clique covering and clique partition numbers cc(...
summary:The aim of the paper is to show that no simple graph has a proper subgraph with the same nei...
AbstractIn this paper, we introduce a new multivalued function L called the line hypergraph. The fun...
In this paper, we introduce a new multivalued function ℒ called the line hypergraph. The function ℒ ...
In this paper, we introduce a new multivalued function ℒ called the line hypergraph. The function ℒ ...
In this paper, we introduce a new multivalued function ? called the line hypergraph. The function ? ...
The survey is devoted to line graphs and a new multivalued function L called the line hypergraph. Th...
The survey is devoted to line graphs and a new multivalued function L called the line hypergraph. Th...
The survey is devoted to line graphs and a new multivalued function L called the line hypergraph. Th...
AbstractH. Whitney proved that, apart from a simple exeptional case, whenever the line graphs of two...
AbstractH. Whitney proved that, apart from a simple exeptional case, whenever the line graphs of two...
AbstractThis paper presents a new proof of Whitney's theorem on edge-isomorphisms of graphs and exte...
The line graph operation, in which the edges of one graph are taken as the vertices of a new graph, ...
In this paper, some notions and basic concepts related to hypergraph are presented. Next, hypergraph...
AbstractLet G be a line graph. Orlin determined the clique covering and clique partition numbers cc(...
AbstractLet G be a line graph. Orlin determined the clique covering and clique partition numbers cc(...
summary:The aim of the paper is to show that no simple graph has a proper subgraph with the same nei...
AbstractIn this paper, we introduce a new multivalued function L called the line hypergraph. The fun...
In this paper, we introduce a new multivalued function ℒ called the line hypergraph. The function ℒ ...
In this paper, we introduce a new multivalued function ℒ called the line hypergraph. The function ℒ ...
In this paper, we introduce a new multivalued function ? called the line hypergraph. The function ? ...
The survey is devoted to line graphs and a new multivalued function L called the line hypergraph. Th...
The survey is devoted to line graphs and a new multivalued function L called the line hypergraph. Th...
The survey is devoted to line graphs and a new multivalued function L called the line hypergraph. Th...
AbstractH. Whitney proved that, apart from a simple exeptional case, whenever the line graphs of two...
AbstractH. Whitney proved that, apart from a simple exeptional case, whenever the line graphs of two...
AbstractThis paper presents a new proof of Whitney's theorem on edge-isomorphisms of graphs and exte...
The line graph operation, in which the edges of one graph are taken as the vertices of a new graph, ...
In this paper, some notions and basic concepts related to hypergraph are presented. Next, hypergraph...
AbstractLet G be a line graph. Orlin determined the clique covering and clique partition numbers cc(...
AbstractLet G be a line graph. Orlin determined the clique covering and clique partition numbers cc(...
summary:The aim of the paper is to show that no simple graph has a proper subgraph with the same nei...