<--- Back to Details
First PageDocument Content
Graph operations / Graph coloring / Chordal graph / Line graph / Split graph / Clique / Forbidden graph characterization / Neighbourhood / Pathwidth / Strongly chordal graph
Date: 2015-02-02 16:29:21
Graph operations
Graph coloring
Chordal graph
Line graph
Split graph
Clique
Forbidden graph characterization
Neighbourhood
Pathwidth
Strongly chordal graph

C:/Users/Oliver/Dropbox/Andrea-Bang-Oliver/split-vs-set-representation/3-sun-free-split-rootsdvi

Add to Reading List

Source URL: www.zaik.uni-koeln.de

Download Document from Source Website

File Size: 175,51 KB

Share Document on Facebook

Similar Documents

On-line Hierarchical Graph Drawing Stephen C. North and Gordon Woodhull north, AT&T Labs - Research 180 Park Ave. Bldg. 103 Florham Park, New JerseyU.S.A.)

DocID: 1vbCS - View Document

Line Graph When you have something that is measurable and scalable on the x and y-axis. Example – plant height vs. fertilizer amount. Fertilizer amount might go on the x-axis and plant height would go on the y-axis. B

DocID: 1v0CD - View Document

Interactive activity – Lines and bars graph www.webardora.net Activity where we can create a line or a bar graph and also perform several operations on the same data table, etc:

DocID: 1uVcL - View Document

Florian LEHNER The Line Graph of Every Locally Finite 6-Edge-Connected Graph with Finitely Many Ends is Hamiltonian MASTER THESIS

DocID: 1uzeW - View Document

Problem E1. The magnetic permeability of water is essentially unperturbed; connecting the respective points on the graph, we obtain a line corresponding to a flat water sur(10 points) Part A. Qualitative shape of the wat

DocID: 1uaqE - View Document