Characterizing almost-median graphs. II. (Q658076)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Characterizing almost-median graphs. II. |
scientific article |
Statements
Characterizing almost-median graphs. II. (English)
0 references
11 January 2012
0 references
This paper is divided into four sections of which the last two discuss the kernel of the problem. While the third section deals with the convex cycles in a partial cube, Section 4 presents the main theorem, namely that if a graph \(G\) is a partial cube then \(G\) is almost-median if and only if \(G\) contains no convex cycles of length more than \(4\). This paper concludes by giving a short proof of the characterization of almost-median graphs due to \textit{I. Peterin} in his paper [``Quasi-almostmedian graphs,'' Ars Comb. (to appear)]. (For part I see [\textit{B. Brešar}, Eur. J. Comb. 28, No.\,3, 916--920 (2007; Zbl 1113.05029)].)
0 references
partial cube
0 references
median graph
0 references
convex cycle
0 references
almost-median graph
0 references