skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Catalytic Reduction of Dioxygen to Water by a Bioinspired Non-Heme Iron Complex via a 2+2 Mechanism
Award ID(s):
2102156 2018870
PAR ID:
10317601
Author(s) / Creator(s):
; ;
Date Published:
Journal Name:
Journal of the American Chemical Society
Volume:
143
Issue:
40
ISSN:
0002-7863
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ABSTRACT In 1956, Tutte proved the celebrated theorem that every 4‐connected planar graph is Hamiltonian. This result implies that every more than ‐tough planar graph on at least three vertices is Hamiltonian and so has a 2‐factor. Owens in 1999 constructed non‐Hamiltonian maximal planar graphs of toughness arbitrarily close to and asked whether there exists a maximal non‐Hamiltonian planar graph of toughness exactly . In fact, the graphs Owens constructed do not even contain a 2‐factor. Thus the toughness of exactly is the only case left in asking the existence of 2‐factors in tough planar graphs. This question was also asked by Bauer, Broersma, and Schmeichel in a survey. In this paper, we close this gap by constructing a maximal ‐tough plane graph with no 2‐factor, answering the question asked by Owens as well as by Bauer, Broersma, and Schmeichel. 
    more » « less