Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Institution
Articles 1 - 2 of 2
Full-Text Articles in Physical Sciences and Mathematics
Using Magic In Computing Education And Outreach, Ronald I. Greenberg, Dale F. Reed
Using Magic In Computing Education And Outreach, Ronald I. Greenberg, Dale F. Reed
Computer Science: Faculty Publications and Other Works
This special session explores the use of magic tricks based on computer science ideas; magic tricks help grab students' attention and can motivate them to invest more deeply in underlying CS concepts. Error detection ideas long used by computer scientists provide a particularly rich basis for working such "magic'', with a CS Unplugged parity check activity being a notable example. Prior work has shown that one can perform much more sophisticated tricks than the relatively well-known CS Unplugged activity, and these tricks can motivate analyses across a wide variety of computer science concepts and are relevant to learning objectives across …
A Classification Of Certain Graphs With Minimal Imperfection Properties, S. H. Whitesides
A Classification Of Certain Graphs With Minimal Imperfection Properties, S. H. Whitesides
Dartmouth Scholarship
The family of (α, ω) graphs are of interest for several reasons. For example, any minimal counter-example to Berge's Strong Perfect Graph Conjecture belongs to this family. This paper accounts for all (4, 3) graphs. One of these is not obtainable by existing techniques for generating (α + 1, ω) graphs from (α, ω) graphs.