AbstractLet G be a Q4-free median graph on n vertices and m edges. Let k be the number of equivalence classes of Djoković–Winkler's relation Θ and let h be the number of Q3's in G. Then we prove that 2n−m−k+h=2. We also characterize median grid graphs in several different ways, for instance, they are the grid graphs with m−n+1 squares. To obtain these results we introduce the notion of square-edges, i.e. edges contained in exactly one 4-cycle of a graph
AbstractMedian graphs are a natural generalisation of trees and hypercubes that are closely related ...
In this paper we show that if G is a 2-connected graph having minimum degree n such that |V(G)|;≥2n+...
AbstractA graph is Hilbertian if for any three vertices u, v and w, the interval l(u,v) contains a u...
Let G be a Q4-free median graph on n vertices and m edges. Let k be the number of equivalence classe...
AbstractLet G be a median graph on n vertices and m edges and let k be the number of equivalence cla...
AbstractWe generalize the well-known relation for trees n−m=1 to the class of median graphs in the f...
A profile is a finite sequence of vertices of a graph. The set of all vertices of the graph which mi...
AbstractLet G be a cube-free median graph. It is proved that k/2⩾n-1⩾m/2n⩾s⩾r-1, where n, m, s, k, a...
Median graphs are connected graphs in which for all three vertices there is a unique vertex that bel...
Definition(s): A graph G is a median graph if for every triple of vertices u, v, and w there exists ...
AbstractThe τ-graph Gτ of a partial cube G has the equivalence classes of the Djoković–Winkler relat...
AbstractThe crossing graph G# of a partial cube G has the equivalence classes of the Djoković–Winkle...
Median graphs are a natural generalisation of trees and hypercubes that are closely related to distr...
the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduc...
AbstractA hierarchy of classes of graphs is proposed which includes hypercubes, acyclic cubical comp...
AbstractMedian graphs are a natural generalisation of trees and hypercubes that are closely related ...
In this paper we show that if G is a 2-connected graph having minimum degree n such that |V(G)|;≥2n+...
AbstractA graph is Hilbertian if for any three vertices u, v and w, the interval l(u,v) contains a u...
Let G be a Q4-free median graph on n vertices and m edges. Let k be the number of equivalence classe...
AbstractLet G be a median graph on n vertices and m edges and let k be the number of equivalence cla...
AbstractWe generalize the well-known relation for trees n−m=1 to the class of median graphs in the f...
A profile is a finite sequence of vertices of a graph. The set of all vertices of the graph which mi...
AbstractLet G be a cube-free median graph. It is proved that k/2⩾n-1⩾m/2n⩾s⩾r-1, where n, m, s, k, a...
Median graphs are connected graphs in which for all three vertices there is a unique vertex that bel...
Definition(s): A graph G is a median graph if for every triple of vertices u, v, and w there exists ...
AbstractThe τ-graph Gτ of a partial cube G has the equivalence classes of the Djoković–Winkler relat...
AbstractThe crossing graph G# of a partial cube G has the equivalence classes of the Djoković–Winkle...
Median graphs are a natural generalisation of trees and hypercubes that are closely related to distr...
the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduc...
AbstractA hierarchy of classes of graphs is proposed which includes hypercubes, acyclic cubical comp...
AbstractMedian graphs are a natural generalisation of trees and hypercubes that are closely related ...
In this paper we show that if G is a 2-connected graph having minimum degree n such that |V(G)|;≥2n+...
AbstractA graph is Hilbertian if for any three vertices u, v and w, the interval l(u,v) contains a u...
DOI
Add to ORKG