On the bi-enhancement of chordal-bipartite probe graphs

Elad Cohen; Martin Charles Golumbic; Marina Lipshteyn; Michal Stern

On the bi-enhancement of chordal-bipartite probe graphs

Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern

Department of Computer Science

Research output: Contribution to conference › Paper › peer-review

Abstract

Lately, a lot of research has been done on C -probe graphs. In this paper we focus on chordal-bipartite probe graphs. We prove a structural result that if B is a bipartite graph with no chordless cycle of length strictly greater than 6, then B is chordal-bipartite probe if and only if a certain "enhanced" graph B* is a chordal-bipartite graph. This theorem is analogous to a result on interval probe graphs in [13] and to one on chordal probe graphs in [8].

Original language	English
Pages	152-156
Number of pages	5
State	Published - 2008
Event	7th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2008 - Gargnano, Italy Duration: 13 May 2008 → 15 May 2008

Conference

Conference	7th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2008
Country/Territory	Italy
City	Gargnano
Period	13/05/08 → 15/05/08

Keywords

Bipartite
Chordal
Probe

ASJC Scopus subject areas

Control and Optimization
Discrete Mathematics and Combinatorics

Cite this

@conference{2bb5ca74456044c5b342da1a4aa892fc,

title = "On the bi-enhancement of chordal-bipartite probe graphs",

abstract = "Lately, a lot of research has been done on C -probe graphs. In this paper we focus on chordal-bipartite probe graphs. We prove a structural result that if B is a bipartite graph with no chordless cycle of length strictly greater than 6, then B is chordal-bipartite probe if and only if a certain {"}enhanced{"} graph B* is a chordal-bipartite graph. This theorem is analogous to a result on interval probe graphs in [13] and to one on chordal probe graphs in [8].",

keywords = "Bipartite, Chordal, Probe",

author = "Elad Cohen and Golumbic, \{Martin Charles\} and Marina Lipshteyn and Michal Stern",

year = "2008",

language = "English",

pages = "152--156",

note = "7th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2008 ; Conference date: 13-05-2008 Through 15-05-2008",

}

TY - CONF

T1 - On the bi-enhancement of chordal-bipartite probe graphs

AU - Cohen, Elad

AU - Golumbic, Martin Charles

AU - Lipshteyn, Marina

AU - Stern, Michal

PY - 2008

Y1 - 2008

N2 - Lately, a lot of research has been done on C -probe graphs. In this paper we focus on chordal-bipartite probe graphs. We prove a structural result that if B is a bipartite graph with no chordless cycle of length strictly greater than 6, then B is chordal-bipartite probe if and only if a certain "enhanced" graph B* is a chordal-bipartite graph. This theorem is analogous to a result on interval probe graphs in [13] and to one on chordal probe graphs in [8].

AB - Lately, a lot of research has been done on C -probe graphs. In this paper we focus on chordal-bipartite probe graphs. We prove a structural result that if B is a bipartite graph with no chordless cycle of length strictly greater than 6, then B is chordal-bipartite probe if and only if a certain "enhanced" graph B* is a chordal-bipartite graph. This theorem is analogous to a result on interval probe graphs in [13] and to one on chordal probe graphs in [8].

KW - Bipartite

KW - Chordal

KW - Probe

UR - https://www.scopus.com/pages/publications/84883121893

M3 - Paper

AN - SCOPUS:84883121893

SP - 152

EP - 156

T2 - 7th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2008

Y2 - 13 May 2008 through 15 May 2008

ER -

On the bi-enhancement of chordal-bipartite probe graphs

Abstract

Conference

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this