AbstractWe study the problem of the existence of V-, N∗- and V∗-orderings in graphs. These orderings are defined in terms of 1- and 2-vertex neighbourhoods in graphs. Two conjectures concerning V- and N∗-ordering are formulated. A partial list of graphs without V∗-ordering is presented. The relation between the class of cotolerance graphs and the classes of N∗-perfect graphs and V∗-graphs is established
AbstractThe question whether a polynomial time recognition algorithm for the class of perfectly orde...
AbstractPerfectly orderable graphs are such that an ordering x1>2>…>xn of the nodes can be found for...
AbstractWe establish a property of minimal nonperfectly orderable graphs, and use this property to g...
AbstractWe study the problem of the existence of V-, N∗- and V∗-orderings in graphs. These orderings...
AbstractThis paper generalizes previous works on perfectly orderable graphs by Olariu (Discrete Math...
AbstractPerfectly orderable graphs were introduced by Chvátal in 1984. Since then, several classes o...
AbstractLet k be a positive integer. An ordered k-colouring of a graph G is a function c from V(G) i...
AbstractAn ordered graph is a graph whose vertices are positive integers. Two ordered graphs are iso...
AbstractWe introduce a new class of perfectly orderable graphs that contains complements of chordal ...
AbstractWe investigate the following conjecture of Vašek Chvátal: any weakly triangulated graph cont...
AbstractIn a graph G = (V, E) provided with a linear order ‘ < ’ on V, a chordless path with vertice...
AbstractWe consider a construction which associated with a graph G another graph G′ such that if G′ ...
We investigate the following conjecture of Vašek Chvátal: any weakly triangulated graph containing n...
An ordering of a graph G is a bijection of V(G) to {1, . . . , |V(G)|}. In this thesis, we consider ...
AbstractThis paper presents new algorithms for recognizing several classes of perfectly orderable gr...
AbstractThe question whether a polynomial time recognition algorithm for the class of perfectly orde...
AbstractPerfectly orderable graphs are such that an ordering x1>2>…>xn of the nodes can be found for...
AbstractWe establish a property of minimal nonperfectly orderable graphs, and use this property to g...
AbstractWe study the problem of the existence of V-, N∗- and V∗-orderings in graphs. These orderings...
AbstractThis paper generalizes previous works on perfectly orderable graphs by Olariu (Discrete Math...
AbstractPerfectly orderable graphs were introduced by Chvátal in 1984. Since then, several classes o...
AbstractLet k be a positive integer. An ordered k-colouring of a graph G is a function c from V(G) i...
AbstractAn ordered graph is a graph whose vertices are positive integers. Two ordered graphs are iso...
AbstractWe introduce a new class of perfectly orderable graphs that contains complements of chordal ...
AbstractWe investigate the following conjecture of Vašek Chvátal: any weakly triangulated graph cont...
AbstractIn a graph G = (V, E) provided with a linear order ‘ < ’ on V, a chordless path with vertice...
AbstractWe consider a construction which associated with a graph G another graph G′ such that if G′ ...
We investigate the following conjecture of Vašek Chvátal: any weakly triangulated graph containing n...
An ordering of a graph G is a bijection of V(G) to {1, . . . , |V(G)|}. In this thesis, we consider ...
AbstractThis paper presents new algorithms for recognizing several classes of perfectly orderable gr...
AbstractThe question whether a polynomial time recognition algorithm for the class of perfectly orde...
AbstractPerfectly orderable graphs are such that an ordering x1>2>…>xn of the nodes can be found for...
AbstractWe establish a property of minimal nonperfectly orderable graphs, and use this property to g...
DOI
Add to ORKG