On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs

Celina M.H. de Figueiredo; Luérbio Faria; Sulamita Klein; R. Sritharan

doi:10.1016/j.tcs.2007.04.007

ScienceGate Book Chapters

JOURNAL ARTICLE

On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs

Celina M.H. de Figueiredo Luérbio Faria Sulamita Klein R. Sritharan

Year: 2007 Journal: Theoretical Computer Science Vol: 381 (1-3)Pages: 57-67 Publisher: Elsevier BV

DOI: 10.1016/j.tcs.2007.04.007

Get Full-Text PDF Get Analytical Report

Keywords:

Chordal graph Combinatorics Bipartite graph Mathematics Interval graph Split graph Pathwidth Indifference graph Discrete mathematics Treewidth Graph 1-planar graph Line graph

Metrics

Cited By

3.40

FWCI (Field Weighted Citation Impact)

Refs

0.92

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

graph theory and CDMA systems

Physical Sciences → Engineering → Electrical and Electronic Engineering

Interconnection Networks and Systems

Physical Sciences → Computer Science → Computer Networks and Communications

On the complexity of the sandwich problems for strongly chordal graphs and chordal bipartite graphs

Metrics

Citation History

Topics

Related Documents

Chordal bipartite, strongly chordal, and strongly chordal bipartite graphs

Strongly chordal and chordal bipartite graphs are sandwich monotone

Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone

Graph isomorphism completeness for chordal bipartite graphs and strongly chordal graphs

Strongly orderable graphs A common generalization of strongly chordal and chordal bipartite graphs