The following pages link to David M. Berman (Q1144037):
Displaying 16 items.
- Critical graphs for chromatic difference sequences (Q1144038) (← links)
- The number of cut-vertices in a graph of given minimum degree (Q1176737) (← links)
- Every planar graph has an acyclic 7-coloring (Q1245228) (← links)
- The chromatic difference sequence of a graph (Q1246543) (← links)
- All trees contain a large induced subgraph having all degrees 1 (mod \(k\)) (Q1377743) (← links)
- Combinatorial Aspects of the Orrery Model of Syntax (Q3332274) (← links)
- (Q3697034) (← links)
- (Q4028493) (← links)
- (Q4083696) (← links)
- (Q4111593) (← links)
- An acyclic analogue to Heawood's theorem (Q4156455) (← links)
- Critical Graphs for Acyclic Colorings (Q4161340) (← links)
- (Q4222092) (← links)
- (Q4349614) (← links)
- Graphs with homeomorphically irreducible spanning trees (Q4713007) (← links)
- (Q4740585) (← links)
