## Congressus Numerantium, Volumes 182-183 |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

The Cheesecake Factory Problem by Dalibor Froncek and Mariusz Meszka | 5 |

Further Results on Holes in L2l Coloring on Certain Classes of Graphs | 11 |

Characterizations of Treelike Comparability Graphs | 23 |

Copyright | |

16 other sections not shown

### Other editions - View all

### Common terms and phrases

a-convex sequence adjacent algorithm BHR-tilings bijection blocks border tiles braid group BW(G chord chordal graphs chordless cycle Chrom(G chromatic number closure codes Combinatorics comparability graph complete graph Computer CONGRESSUS NUMERANTIUM 182 consists cop-win copies Corollary cubic graphs cycle of length decomposition define delete denote Department of Mathematics diam(G digraph Discrete Math distance downset Dyck paths eigenvalues elements encoding exists Figure function Golomb Golomb ruler graceful labeling graph G Graph Theory Hamiltonian hamiltonian paths harmonic center Hence hypergraph induced subgraph interval graphs isomorphic Jamison lattice Lemma Let G line graph minimal dominator partition minimum multicovering Motzkin path multidecomposition multidesigns multipacking node Note NT convex labeling pair paths of length permutation poset problem Proof proper coloring Proposition remaining edges result Schroder paths sum-saturating Suppose Theorem tiling graph tournament tree treelike graph triangle triple upper bound vertex set vertices Weyl group