AbstractA graph is a P4-comparability graph if it admits an acyclic orientation of its edges which is transitive on every chordless path on four vertices. We give a characterization of P4-comparability graphs in terms of an auxiliary graph being bipartite
A P4-transversal of a graph G is a set of vertices T which meet every P4 of G. A P4-transversal T is...
AbstractTwo graphs G and H with the same vertex set V are P4-isomorphic if there exists a permutatio...
Two edges are called P adjacent if they belong to the same P chordless path on vertices P componen...
AbstractA graph is a P4-comparability graph if it admits an acyclic orientation of its edges which i...
AbstractTwo edges are called P4-adjacent if they belong to the same P4 (chordless path on four verti...
Abstract. We consider the problem of recognizing whether a simple undirected graph is a P4-comparabi...
AbstractIn 1981, Chvátal defined the class of perfectly orderable graphs. This class of perfect grap...
Abstract. We consider two problems pertaining to P4-comparability graphs, namely, the problem of rec...
We consider two problems pertaining to P4-comparability graphs, namely, the problem of recognizing w...
Two edges are called P 4 -adjacent if they belong to the same P 4 (chordless path on 4 vertices). P ...
AbstractMa and Spinrad have shown that every transitive orientation of a chordal comparability graph...
We characterize even and odd pairs in comparability and in P4-comparability graphs. The characteriza...
A comparability graph is a graph whose edges can be oriented transitively. Given a comparability gra...
Abstract A P 4 -transversal of a graph G is a set of vertices T which meets every P 4 of G. A P 4 -t...
AbstractThe P4-structure of a graph G=(V,E) is a hypergraph H=(V,E) such that the hyperedges from H ...
A P4-transversal of a graph G is a set of vertices T which meet every P4 of G. A P4-transversal T is...
AbstractTwo graphs G and H with the same vertex set V are P4-isomorphic if there exists a permutatio...
Two edges are called P adjacent if they belong to the same P chordless path on vertices P componen...
AbstractA graph is a P4-comparability graph if it admits an acyclic orientation of its edges which i...
AbstractTwo edges are called P4-adjacent if they belong to the same P4 (chordless path on four verti...
Abstract. We consider the problem of recognizing whether a simple undirected graph is a P4-comparabi...
AbstractIn 1981, Chvátal defined the class of perfectly orderable graphs. This class of perfect grap...
Abstract. We consider two problems pertaining to P4-comparability graphs, namely, the problem of rec...
We consider two problems pertaining to P4-comparability graphs, namely, the problem of recognizing w...
Two edges are called P 4 -adjacent if they belong to the same P 4 (chordless path on 4 vertices). P ...
AbstractMa and Spinrad have shown that every transitive orientation of a chordal comparability graph...
We characterize even and odd pairs in comparability and in P4-comparability graphs. The characteriza...
A comparability graph is a graph whose edges can be oriented transitively. Given a comparability gra...
Abstract A P 4 -transversal of a graph G is a set of vertices T which meets every P 4 of G. A P 4 -t...
AbstractThe P4-structure of a graph G=(V,E) is a hypergraph H=(V,E) such that the hyperedges from H ...
A P4-transversal of a graph G is a set of vertices T which meet every P4 of G. A P4-transversal T is...
AbstractTwo graphs G and H with the same vertex set V are P4-isomorphic if there exists a permutatio...
Two edges are called P adjacent if they belong to the same P chordless path on vertices P componen...
DOI
Add to ORKG