On Hamilton Decompositions of Line Graphs of Non-Hamiltonian Graphs and Graphs without Separating Transitions

In contrast with Kotzig's result that the line graph of a $3$-regular graph $X$ is Hamilton decomposable if and only if $X$ is Hamiltonian, we show that for each integer $k\geq 4$ there exists a simple non-Hamiltonian $k$-regular graph whose line graph has a Hamilton decomposition. We also answer a question of Jackson by showing that for each integer $k\geq 3$ there exists a simple connected $k$-regular graph with no separating transitions whose line graph has no Hamilton decomposition

How Reporters Can Evaluate Automated Driving Announcements

This article identifies a series of specific questions that reporters can ask about claims made by developers of automated motor vehicles (“AVs”). Its immediate intent is to facilitate more critical, credible, and ultimately constructive reporting on progress toward automated driving. In turn, reporting of this kind advances three additional goals. First, it encourages AV developers to qualify and support their public claims. Second, it appropriately manages public expectations about these vehicles. Third, it fosters more technical accuracy and technological circumspection in legal and policy scholarship

How Government Can Promote Automated Driving

This Article presents steps that governments can take now to encourage the development, deployment, and use of automated road vehicles. After providing technical and legal context, it describes key administrative, legal, and community strategies to promote automated driving. It concludes by urging policymakers to facilitate automated driving in part by expecting more from today’s drivers and vehicles