We give an upper bound of the number of edges of a permutation graph. We introduce some necessary conditions for a graph to be a permutation graph, and we discuss the independence of these necessary conditions. We show that they are altogether not sufficient for a graph to be a permutation graph
Abstract. A permutation graph is an intersection graph of segments lying between two parallel lines....
We establish a correspondence among loops, regular permutation sets and directed graphs with a suita...
AbstractWe investigate the enumerative aspects of various classes of perfect graphs like cographs, s...
AbstractWe give an upper bound of the number of edges of a permutation graph. We introduce some nece...
If i, j belongs to a permutation on n symbols {1, 2, …, p} and i is less than j then there is an edg...
AbstractWe determine all permutation graphs of order ⩽9. We prove that every bipartite graph of orde...
We consider finite simple graphs and the terminology of Harary [4] and Behzad—Chartrand [1] is used....
A (p, q)-graph G is said to be a permutation (combination) graph if G admits an assignment of distin...
AbstractIn this note we provide a generalization of a result of Goddard et al. (2003) [4] on edge-co...
There is a permutation of the vertices of a tree for which no proper subtree on at least two vertice...
For a finite graph G whose vertices are different natural numbers we call two infinite permutations ...
AbstractPermutation graphs were first introduced by Chartrand and Harary in 1967 [5]. The purpose of...
AbstractAn edge cut W of a connected graph G is a k-restricted edge cut if G−W is disconnected, and ...
The graph reconstruction conjecture is a long-standing open problem in graph theory. The conjecture ...
AbstractA permutation graph Gπ of a graph G (or generalized prism) is obtained by taking two disjoin...
Abstract. A permutation graph is an intersection graph of segments lying between two parallel lines....
We establish a correspondence among loops, regular permutation sets and directed graphs with a suita...
AbstractWe investigate the enumerative aspects of various classes of perfect graphs like cographs, s...
AbstractWe give an upper bound of the number of edges of a permutation graph. We introduce some nece...
If i, j belongs to a permutation on n symbols {1, 2, …, p} and i is less than j then there is an edg...
AbstractWe determine all permutation graphs of order ⩽9. We prove that every bipartite graph of orde...
We consider finite simple graphs and the terminology of Harary [4] and Behzad—Chartrand [1] is used....
A (p, q)-graph G is said to be a permutation (combination) graph if G admits an assignment of distin...
AbstractIn this note we provide a generalization of a result of Goddard et al. (2003) [4] on edge-co...
There is a permutation of the vertices of a tree for which no proper subtree on at least two vertice...
For a finite graph G whose vertices are different natural numbers we call two infinite permutations ...
AbstractPermutation graphs were first introduced by Chartrand and Harary in 1967 [5]. The purpose of...
AbstractAn edge cut W of a connected graph G is a k-restricted edge cut if G−W is disconnected, and ...
The graph reconstruction conjecture is a long-standing open problem in graph theory. The conjecture ...
AbstractA permutation graph Gπ of a graph G (or generalized prism) is obtained by taking two disjoin...
Abstract. A permutation graph is an intersection graph of segments lying between two parallel lines....
We establish a correspondence among loops, regular permutation sets and directed graphs with a suita...
AbstractWe investigate the enumerative aspects of various classes of perfect graphs like cographs, s...
DOI
Add to ORKG