AbstractWe determine all permutation graphs of order ⩽9. We prove that every bipartite graph of order ⩽50 is a permutation graph. We convert the conjecture stating that “every tree is a permutation graph” to be “every bipartite graph is a permutation graph”
If i, j belongs to a permutation on n symbols {1, 2, …, p} and i is less than j then there is an edg...
We consider finite simple graphs and the terminology of Harary [4] and Behzad—Chartrand [1] is used....
We consider graphs whose vertex set is the set of permutations of the first n natural numbers. Two s...
We give an upper bound of the number of edges of a permutation graph. We introduce some necessary co...
A (p, q)-graph G is said to be a permutation (combination) graph if G admits an assignment of distin...
AbstractWe give an upper bound of the number of edges of a permutation graph. We introduce some nece...
The graph reconstruction conjecture is a long-standing open problem in graph theory. The conjecture ...
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipar...
In his paper [1], J. Dénes proved that the set Tn of labeled trees of n vertices and the set of repr...
AbstractA coloring of a graph G is an assignment of colors to its vertices so that no two adjacent v...
AbstractConnected bipartite permutation graphs without vertex labels are investigated. First, the nu...
AbstractPermutation graphs were first introduced by Chartrand and Harary in 1967 [5]. The purpose of...
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of ...
AbstractIt has been shown that a connection can be made between labeled trees and representations of...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
If i, j belongs to a permutation on n symbols {1, 2, …, p} and i is less than j then there is an edg...
We consider finite simple graphs and the terminology of Harary [4] and Behzad—Chartrand [1] is used....
We consider graphs whose vertex set is the set of permutations of the first n natural numbers. Two s...
We give an upper bound of the number of edges of a permutation graph. We introduce some necessary co...
A (p, q)-graph G is said to be a permutation (combination) graph if G admits an assignment of distin...
AbstractWe give an upper bound of the number of edges of a permutation graph. We introduce some nece...
The graph reconstruction conjecture is a long-standing open problem in graph theory. The conjecture ...
The class of bipartite permutation graphs is the intersection of two well known graph classes: bipar...
In his paper [1], J. Dénes proved that the set Tn of labeled trees of n vertices and the set of repr...
AbstractA coloring of a graph G is an assignment of colors to its vertices so that no two adjacent v...
AbstractConnected bipartite permutation graphs without vertex labels are investigated. First, the nu...
AbstractPermutation graphs were first introduced by Chartrand and Harary in 1967 [5]. The purpose of...
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of ...
AbstractIt has been shown that a connection can be made between labeled trees and representations of...
International audienceWe introduce permutrees, a unified model for permutations, binary trees, Cambr...
If i, j belongs to a permutation on n symbols {1, 2, …, p} and i is less than j then there is an edg...
We consider finite simple graphs and the terminology of Harary [4] and Behzad—Chartrand [1] is used....
We consider graphs whose vertex set is the set of permutations of the first n natural numbers. Two s...
DOI
Add to ORKG