| 31. | A clique in the complement of the line graph of " G " is just a matching in " G ".
|
| 32. | Therefore, K�nig's theorem itself can also be interpreted as stating that the complements of line graphs of bipartite graphs are perfect.
|
| 33. | One can also connect K�nig's Line Coloring Theorem to a different class of perfect graphs, the line graphs of bipartite graphs.
|
| 34. | In this respect the graph itself is somewhat misleading : it takes annual summary data and plots as a line graph.
|
| 35. | Wikipedia currently does not have graph making software installed ( i . e . line graphs, bar graphs, and so on ).
|
| 36. | From a stackof papers on his desk, he fishes out a transparency of a line graph takenfrom the Finance Ministry's Economic Report.
|
| 37. | The following figures show a graph ( left, with blue vertices ) and its line graph ( right, with green vertices ).
|
| 38. | Each vertex of the line graph is shown labeled with the pair of endpoints of the corresponding edge in the original graph.
|
| 39. | For connected graphs that are not paths, all sufficiently high numbers of iteration of the line graph operation produce graphs that are Hamiltonian.
|
| 40. | Dury used a line graph and a logarithmic scale, plotting the discharge along the x-axis and the other stream variables along the y-axis.
|
