# Items where Subject is "05-XX Combinatorics > 05Cxx Graph theory > 05C75 Structural characterization of types of graphs"

Up a level |

- MSC Classification Numbers (14)
- 05-XX Combinatorics (14)
- 05Cxx Graph theory (14)
**05C75 Structural characterization of types of graphs**(14)

- 05Cxx Graph theory (14)

- 05-XX Combinatorics (14)

**14**.

## B

Bose, Prosenjit K. and Everett, Hazel and Fekete, Sandor P. and Houle, Michael and Lubiw, Anna and Meijer, Henk and Romanik, Kathleen A. and Rote, Günter and Shermer, Thomas C. and Whitesides, Sue and Zelle, Christian
(1998)
*On a visibility representation for graphs in 3D.*
**Published in: **
Journal of Graph Algorithms and Applications Vol. 2 (3).
pp. 1-16.

Bose, Prosenjit K. and Everett, Hazel and Fekete, Sandor P. and Lubiw, Anna and Meijer, Henk and Romanik, Kathleen A. and Shermer, Thomas C. and Whitesides, Sue
(1994)
*On a visibility representation for graphs in three dimensions.*

Technical Report
, 24 p.

Bose, Prosenjit K. and Everett, Hazel and Fekete, Sandor P. and Lubiw, Anna and Meijer, Henk and Romanik, Kathleen A. and Shermer, Thomas C. and Whitesides, Sue
(1993)
*On a visibility representation for graphs in three dimensions.*
**Published In:**
Graph drawing : 9th international symposium ; ALCOM International Workshop Paris 1993 on Graph Drawing and Topological Graph Algorithms Alcom 1993, pp. 38-39.

## D

Dahlhaus, Elias
(1998)
*Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs.*
**Published In:**
Graph-theoretic concepts in computer science : 24th international workshop, WG '98, Smolenice Castle, Slovak Republic, June 18 - 20, 1998 ; proceedings, Lecture notes in computer science. 1517 Springer 1998, pp. 713-724.

Dahlhaus, Elias
(1999)
*Minimum Fill-in and Treewidth for Graphs Modularly Decomposable into Chordal Graphs.*

Technical Report
, 13 p.

## F

Fekete, Sandor P.
(1997)
*Geometric Ideas for Graph Representation and for Cooperative Game Theory.*

Technical Report
, 54 p.

Fekete, Sandor P. and Houle, Michael and Whitesides, Sue
(1996)
*New results on a visibility representation of graphs in 3D.*
**Published In:**
Graph drawing : Symposium on Graph Drawing, GD '95, Passau, Germany, September 20 - 22, 1995 ; proceedings, Lecture notes in computer science. 1027 Springer 1996, pp. 234-241.

Fekete, Sandor P. and Houle, Michael and Whitesides, Sue
(1997)
*The wobbly logic engine: proving hardness of non-rigid geometric graph representations.*
**Published In:**
Graph drawing : 5th international symposium, GD '97, Rome, Italy, September 18 - 20, 1997 ; proceedings, Lecture notes in computer science. 1353 Springer 1997, pp. 272-283.

Fekete, Sandor P. and Meijer, Henk
(1999)
*Rectangle and Box Visibility Graphs in 3D.*
**Published in: **
International Journal of Computational Geometry and Applications : : IJCGA Vol. 9 (1).
pp. 1-27.

## K

Korach, Ephraim and Nguyen, Thành and Peis, Britta
(2006)
*Subgraph characterization of Red/Blue-split graphs and König-Egerváry graphs.*
**Published In:**
SODA : Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms ; Miami, FL., January 22 - 24, 2006 ACM 2006, pp. 842-850.

## M

Mallach, Sven
(2011)
*On separation pairs and split components of biconnected graphs.*

Technical Report
, 16 p.

Middendorf, Matthias and Pfeiffer, Frank
(1993)
*Weakly Transitive Orientations, Hasse Diagrams and String Graphs.*
**Published in: **
Discrete mathematics Vol. 111 (1-3).
pp. 393-400.

## R

Rieder, Jörg
(1992)
*A Note on the f-Factor Lattice of Bipartite Graphs.*
**Published in: **
Journal of combinatorial theory : series B Vol. 56 (1).
pp. 90-96.

## S

Schaudt, Oliver and Schrader, Rainer and Weil, Vera
(2013)
*On the separability of graphs.*
**Published in: **
Discrete Mathematics Vol. 313 (6).
pp. 809-820.