Add to ORKGpeer reviewedIn this paper, we give a lengthy proof of a small result! A graph is bisplit if its vertex set can be partitioned into three stable sets with two of them inducing a complete bipartite graph. We prove that these graphs satisfy the Chen-Chv atal conjecture: their metric space (in the usual sense) has a universal line (in an unusual sense) or at least as many lines as the number of vertices. © 2019 by the author(s).ANR-15-CE40-0009: 2015-201
Erdös proved that every graph G has a bipartite, spanning subgraph B such that dB(v) ≥ dG(v) 2 for a...
A bipartite-split graph is a bipartite graph whose vertex set can be partitioned into a complete bip...
For each s ≥ 2, there exists m0 such that the following holds for all m ≥ m0: Let G be a bipartite g...
peer reviewedIn this paper, we give a lengthy proof of a small result! A graph is bisplit if its ver...
The line generated by two distinct points, x and y, in a finite metric space M=(V,d), is the set of ...
An undirected graph G = (V, E) is a bisplit graph if its vertex set can be partitioned into a stable...
AbstractAn undirected graph G=(V,E) is a bisplit graph if its vertex set can be partitioned into a s...
A famous result of Graham and Pollak states that the complete graph with n vertices can be edge part...
AbstractWe prove that, if a graph G (without multiple edges) has maximum degree d and edge-chromatic...
International audienceA set of n points in the plane which are not all collinear defines at least n ...
Based on a ternary betweenness relation, Coxeter introduced the notion of a line in ordered geometri...
AbstractAn embedding of a graph into a space is linear if each edge is a straight line segment. In 1...
A bisection of a graph is a bipartition of its vertex set in which the number of vertices in the two...
International audienceA special case of a combinatorial theorem of De Bruijn and Erd˝ os asserts tha...
AbstractThe Clique-Pair-Conjecture (CPC) states that a uniquely colourable perfect graph, different ...
Erdös proved that every graph G has a bipartite, spanning subgraph B such that dB(v) ≥ dG(v) 2 for a...
A bipartite-split graph is a bipartite graph whose vertex set can be partitioned into a complete bip...
For each s ≥ 2, there exists m0 such that the following holds for all m ≥ m0: Let G be a bipartite g...
peer reviewedIn this paper, we give a lengthy proof of a small result! A graph is bisplit if its ver...
The line generated by two distinct points, x and y, in a finite metric space M=(V,d), is the set of ...
An undirected graph G = (V, E) is a bisplit graph if its vertex set can be partitioned into a stable...
AbstractAn undirected graph G=(V,E) is a bisplit graph if its vertex set can be partitioned into a s...
A famous result of Graham and Pollak states that the complete graph with n vertices can be edge part...
AbstractWe prove that, if a graph G (without multiple edges) has maximum degree d and edge-chromatic...
International audienceA set of n points in the plane which are not all collinear defines at least n ...
Based on a ternary betweenness relation, Coxeter introduced the notion of a line in ordered geometri...
AbstractAn embedding of a graph into a space is linear if each edge is a straight line segment. In 1...
A bisection of a graph is a bipartition of its vertex set in which the number of vertices in the two...
International audienceA special case of a combinatorial theorem of De Bruijn and Erd˝ os asserts tha...
AbstractThe Clique-Pair-Conjecture (CPC) states that a uniquely colourable perfect graph, different ...
Erdös proved that every graph G has a bipartite, spanning subgraph B such that dB(v) ≥ dG(v) 2 for a...
A bipartite-split graph is a bipartite graph whose vertex set can be partitioned into a complete bip...
For each s ≥ 2, there exists m0 such that the following holds for all m ≥ m0: Let G be a bipartite g...