% EJC papers *must* begin with the following two lines. 
\documentclass[12pt]{article}
\usepackage{e-jc}
\specs{P3.18}{25(3)}{2018}

% Please remove all commands that change parameters such as
%    margins or page sizes.

% Packages amssymb and amstheorem are already loaded. 
% We recommend these AMS packages:
\usepackage{amsmath,amssymb}
% We recommend the graphicx package for importing figures:
\usepackage{graphicx}
% Use this command to create hyperlinks (optional and recommended):
\usepackage[colorlinks=true,citecolor=black,linkcolor=black,urlcolor=blue]{hyperref}

\usepackage{tikz}
\usepackage{caption}
\usepackage{enumerate}
\usepackage[hang,flushmargin]{footmisc}


\newcounter{casenum}	
\newcounter{subcasenum}	
\numberwithin{subcasenum}{casenum}
\newcounter{subsubcasenum}	
\numberwithin{subsubcasenum}{subcasenum}

\setcounter{casenum}{0}
\setcounter{subcasenum}{0}
\setcounter{subsubcasenum}{0}

\renewcommand{\thecasenum}{\arabic{casenum}}
\renewcommand{\thesubcasenum}{\thecasenum.\roman{subcasenum}}
\renewcommand{\thesubsubcasenum}{\thesubcasenum(\alph{subsubcasenum})}

\newcounter{stagenum}
\renewcommand{\thestagenum}{1$\alpha$}


\newenvironment{mycases}
{
  \list{}{%
    \leftmargin0.5cm   % this is the adjusting screw
    \rightmargin0cm%\leftmargin
  }
  \item\relax
	\setcounter{casenum}{0}
}
{	
	\endlist
}
\newenvironment{subcases}
{
  \list{}{%
    \leftmargin0.5cm   % this is the adjusting screw
    \rightmargin0cm%\leftmargin
  }
  \item\relax
}
{	
	\endlist
}


\newcommand{\mycase}[1]{
	\vspace{0.5em}
	
	\refstepcounter{casenum}
	\noindent\hspace{-0.5cm}\textit{Case \thecasenum: #1} 
}

\newcommand{\subcase}[1]{
	\vspace{0.25em}
	
	\refstepcounter{subcasenum}
	\noindent\hspace{-0.5cm}\textit{Case \thesubcasenum: #1} 
}

\newcommand{\subsubcase}[0]{
	\refstepcounter{subsubcasenum}
	\noindent\hspace{-0.6cm}{(\alph{subsubcasenum})}
}

%%%%%%% END CASE ANALYSIS

\newcommand{\sci}{\chi_{s}'(G)}
\newcommand{\scil}{\chi_{\ell,s}'(G)}
\DeclareMathOperator{\ex}{ex}
\DeclareMathOperator{\girth}{girth}
\DeclareMathOperator{\mad}{mad}
\DeclareMathOperator{\ct}{ct}
\DeclareMathOperator{\Resp}{Resp}
\DeclareMathOperator{\dist}{dist}
\newcommand{\bla}{{\ensuremath{^\perp}}}

\allowdisplaybreaks

\tikzset{
insep/.style={inner sep=2pt, outer sep=0pt, circle,fill}, 
free/.style={inner sep=2pt, outer sep=0pt, circle,fill=gray,draw}, 
extra/.style={inner sep=2pt, outer sep=0pt, circle,fill=white,draw}, 
}

% Theorem-like environments that are declared in the style file are:
% theorem, lemma, corollary, proposition, fact, observation, claim,
% definition, example, conjecture, open, problem, question, remark, note

%%%%%%%%%%%%%METADATA%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

% Give the submission and acceptance dates in the format shown.
% The editors will insert the publication date in the third argument.
\dateline{Jul 4, 2015}{Apr 26, 2018}{Jul 27, 2018}

% Give one or more subject codes separated by commas.
% Codes are available from http://www.ams.org/mathscinet/freeTools.html
\MSC{05C15}

% Uncomment exactly one of the following copyright statements.  Alternatively,
% you can write your own copyright statement subject to the approval of the journal.
% See https://creativecommons.org/licenses/ for a full explanation of the 
% Creative Commons licenses.
%
% We strongly recommend CC BY-ND or CC BY. Both these licenses allow others
% to freely distribute your work while giving credit to you. The difference between
% them is that CC BY-ND only allows distribution unchanged and in whole, while
% CC BY also allows remixing, tweaking and building upon your work.  
%
%    One author:
%\Copyright{The author.}
%\Copyright{The author. Released under the CC BY license (International 4.0).}
%\Copyright{The author. Released under the CC BY-ND license (International 4.0).}
%    More than one author:
%\Copyright{The authors.}
%\Copyright{The authors. Released under the CC BY license (International 4.0).}
\Copyright{  The authors. Released under the CC BY-ND license (International 4.0).}

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

% If needed, include a line break (\\) at an appropriate place in the title.
\title{On the Strong Chromatic Index of Sparse Graphs}

% Input author, affiliation, address and support information as follows;
% The address should include the country, but does not have to include
%    the street address. Give at least one email address.

\author{Philip DeOrsey\thanks{Research supported in part by NSF grants DMS-1427526, ``The Rocky Mountain - Great Plains Graduate Research Workshop in Combinatorics" and DMS-1500662 ``The 2015 Rocky Mountain - Great Plains Graduate Research Workshop in Combinatorics".}\\
\small Department of Mathematics\\[-0.8ex]
\small Westfield State University\\[-0.8ex] 
\small Westfield, MA, U.S.A.\\
\small\tt pdeorsey@westfield.ma.edu\\
\and
Michael Ferrara$^*$\thanks{Research supported in part by a Collaboration Grant from the Simons Foundation (\#206692 to Michael Ferrara).} \qquad Nathan Graber$^*$\qquad Stephen G. Hartke$^*$\thanks{Research supported in part by a Collaboration Grant from the Simons Foundation (\#316262 to Stephen G. Hartke)} \\ Luke L. Nelsen$^*$\qquad Eric Sullivan$^*$\\
\small Department of Mathematical and Statistical Sciences\\[-0.8ex]
\small University of Colorado Denver\\[-0.8ex]
\small Denver, CO, U.S.A.\\
\small\tt \{michael.ferrara,nathan.graber,stephen.hartke\}@ucdenver.edu\\[-0.8ex]
\small\tt\{luke.nelsen,eric.sullivan\}@ucdenver.edu\\
\and
Sogol Jahanbekam$^*$\\
\small School of Mathematical Sciences\\[-0.8ex]
\small Rochester Institute of Technology\\[-0.8ex] 
\small Rochester, NY, U.S.A.\\
\small\tt sxjsma@rit.edu\\
\and
Bernard Lidick\'y$^*$\thanks{Research supported in part by NSF grant DMS-126601.}\\
\small Department of Mathematics\\[-0.8ex]
\small Iowa State University\\[-0.8ex] 
\small Ames, IA, U.S.A.\\
\small\tt lidicky@iastate.edu\\
\and
Derrick Stolee$^*$\thanks{Work completed while at Iowa State University.}\\
\small Microsoft\\[-0.8ex]
\small Raliegh, NC, U.S.A.\\
\small\tt dstolee@microsoft.com\\
\and
Jennifer White$^*$\\
\small Department of Mathematics\\[-0.8ex]
\small Saint Vincent College\\[-0.8ex]
\small Latrobe, PA, U.S.A.\\[-0.8ex]
\small\tt jennifer.white@stvincent.edu}


\begin{document}

\maketitle

% E-JC papers must include an abstract. The abstract should consist of a
% succinct statement of background followed by a listing of the
% principal new results that are to be found in the paper. The abstract
% should be informative, clear, and as complete as possible. Phrases
% like "we investigate..." or "we study..." should be kept to a minimum
% in favor of "we prove that..."  or "we show that...".  Do not
% include equation numbers, unexpanded citations (such as "[23]"), or
% any other references to things in the paper that are not defined in
% the abstract. The abstract may be distributed without the rest of the
% paper so it must be entirely self-contained.  Try to include all words
% and phrases that someone might search for when looking for your paper.

\begin{abstract}
  The strong chromatic index of a graph $G$, denoted $\sci$, is the least number of colors needed to edge-color $G$ so that edges at distance at most two receive distinct colors. 
The strong list chromatic index, denoted $\scil$, is the least integer $k$ such that if arbitrary lists of size $k$ are assigned to each edge then $G$ can be edge-colored from those lists where edges at distance at most two receive distinct colors. 
We use the discharging method, the Combinatorial Nullstellensatz, and computation to show that if $G$ is a subcubic planar graph with $\girth(G) \geq 41$ then $\scil \leq 5$, answering a question of Borodin and Ivanova [Precise upper bound for the strong edge chromatic number of sparse planar graphs, \textit{Discuss.~Math.~Graph Theory}, 33(4), (2014) 759--770]. We further show that if $G$ is a subcubic planar graph and  $\girth(G) \geq 30$, then $\sci \leq 5$, improving a bound from the same paper.
Finally, if $G$ is a planar graph with maximum degree at most four and $\girth(G) \geq 28$, then $\sci \leq 7$, improving a more general bound of Wang and Zhao from [Odd graphs and its application on the strong edge-coloring, \textit{Applied Math.~and Computation} 325, (2018), 246--251].
\end{abstract}

\section{Introduction}

A {\it proper edge-coloring} of a graph $G$ is an assignment of colors to the edges so that incident edges receive distinct colors. 
A {\it strong edge-coloring} of a graph $G$ is an assignment of colors to the edges so that edges at distance at most two receive distinct colors. 
A proper edge-coloring is a decomposition of $G$ into matchings, while a strong edge-coloring is a decomposition of $G$ into \emph{induced} matchings.
Fouquet and Jolivet~\cite{Fouquet83,Fouquet84} defined the {\it strong chromatic index} of a graph $G$, denoted $\sci$, as the minimum integer $k$ such that $G$ has a strong edge-coloring using $k$ colors.
Erd\H{o}s and Ne\v{s}et\v{r}il gave the following conjecture, which is still open, and provided an example to show that it would be sharp, if true.  

\begin{conjecture}[Erd\H{o}s and Ne\v{s}et\v{r}il \cite{EN1988}]\label{Erdos}
For every graph $G$, $\chi'_s(G) \leq \dfrac{5}{4}\Delta(G)^2$ when $\Delta(G)$ is even, and $\chi'_s(G) \leq \dfrac{1}{4}(5\Delta(G)^2-2\Delta(G)+1)$ when $\Delta(G)$ is odd.
\end{conjecture}

%Conjecture~\ref{Erdos} remains open. 
Towards this conjecture, Molloy and Reed~\cite{MR}  bounded $\sci$ away from the trivial upper bound of $2\Delta(G)(\Delta(G)-1)+1$ by showing that every graph $G$ with sufficiently large maximum degree satisfies $\sci\leq1.998\Delta(G)^2$.
Bruhn and Joos~\cite{BJ} have announced an improvement, claiming $\sci \leq 1.93\Delta(G)^2$.

%We focus instead on sparsity conditions that imply that the strong chromatic index is very low.
%If a graph $G$ has two adjacent vertices of degree $d$, then $\chi_s'(G) \geq 2d-1$.
%Given sufficient sparsity conditions, equality can hold.

The focus of this paper is the study of strong edge-colorings of \emph{subcubic graphs}, those with maximum degree at most three, and \emph{subquartic graphs}, those with maximum degree at most four.
%The focus of this paper is the study of strong edge-colorings of graphs with bounded maximum degree, in particular of subcubic graphs, the class of graphs with maximum degree at most three.  
Faudree, Gy\'arfas, Schelp, and Tuza~\cite{Faudree90} studied $\sci$ in the class of subcubic graphs, and gave the following conjectures.

\begin{conjecture}[Faudree \textit{et al.} \cite{Faudree90}]
Let $G$ be a subcubic graph.

\begin{enumerate}[(1)]\setlength{\itemsep}{0em}
\item $\sci \leq 10$.
\item If $G$ is bipartite, then $\sci \leq 9$. \label{con:bipartite}
\item If $G$ is planar, then $\sci \leq 9$. \label{con:planar}
\item If $G$ is bipartite and for each edge $xy \in E(G)$, $d(x) + d(y) \leq 5$, then $\sci \leq 6$.
\item If $G$ is bipartite and $C_4 \not \subset G$, then $\sci \leq 7$.
\item If $G$ is bipartite and its girth is large, then $\sci \leq 5$. \label{con:girth}
\end{enumerate}
\label{con:Faud}
\end{conjecture}

Several of these conjectures have been verified, including (1) by Andersen~\cite{Andersen} and (2) by Steger and Yu~\cite{StegerYu}.  Quite recently, Kostochka, Li, Ruksasakchai, Santana, Wang, and Yu~\cite{KLRSWY2014} announced an affirmative resolution to (3).
This result is best possible since the prism, shown in Figure \ref{prism}, is a subcubic planar graph with $\sci = 9$.
Case (4) was also solved~\cite{LMSS,Maydanskiy05,WuLin}.

\begin{figure}[h]
\centering
\begin{tikzpicture}[scale=.65]

\draw (0,0)--(9,0)
(0,0)--(0,4)
(0,4)--(9,4)
(9,4)--(9,0);

\draw (0,0) node[insep]{}
(0,4) node[insep]{}
(9,4) node[insep]{}
(9,0) node[insep]{}
(2,2) node[insep]{}
(7,2) node[insep]{};

\draw (0,0)--(2,2)
(0,4)--(2,2)
(2,2)--(7,2)
(7,2)--(9,4)
(7,2)--(9,0);

\end{tikzpicture}
	
	%\includegraphics[ height = 1.5in]{prism.eps}
	
	\caption{The prism is a subcubic planar graph $G$ with $\sci = 9$.}
	\label{prism}
\end{figure}

Several papers prove sharper bounds on the strong chromatic index of planar graphs with additional structure~\cite{Fouquet84,Hocquard11,Hocquard13,Hudak}, generally by introducing conditions on maximum average degree or girth to ensure that the target graph is sufficiently sparse.  
For a graph $G$, the {\it maximum average degree} of $G$, denoted $\mad(G)$, is the maximum of average degrees over all subgraphs of $G$.
Hocquard, Montassier,  Raspaud, and Valicov~\cite{Hocquard11, Hocquard13} proved the following.
% about subcubic graphs.  


%\clearpage
\begin{theorem}[Hocquard \textit{et al.} \cite{Hocquard13}]\label{theorem:hocquard}
Let $G$ be a subcubic graph.
\begin{enumerate}
\item If $\mad(G) < \frac{7}{3}$, then $\sci \leq 6$.  \label{part1}
\item If $\mad(G) < \frac{5}{2}$, then $\sci \leq 7$. \label{part2}
\item If $\mad(G) < \frac{8}{3}$, then $\sci \leq 8$.
\end{enumerate}
\label{theorem:Hoc}
\end{theorem}

Parts (\ref{part1}) and (\ref{part2}) of Theorem~\ref{theorem:hocquard} are sharp by the graphs shown in Figures \ref{fig:house} and \ref{fig:diamond}, respectively.
An elementary application of Euler's Formula (see \cite{west}) gives the following.


\begin{proposition}
If $G$ is a planar graph with girth $g$ then $\mad(G) < \frac{2g}{g-2}$.
\label{prop:mad}
\end{proposition}


\begin{figure}[htbp]
\centering
\begin{minipage}{.5\textwidth}
  \centering
  \begin{tikzpicture}[scale=1]

\draw (0,0)--(0,2)
(0,2)--(2,2)
(2,2)--(2,0)
(2,0)--(0,0);

\draw
(0,0) node[insep]{}
(0,2) node[insep]{}
(2,2) node[insep]{}
(2,0) node[insep]{}
(1,2) node[insep]{}
(1,3.5) node[insep]{}
(0,2)--(1,3.5)
(1,3.5)--(2,2);

\end{tikzpicture}
  %\includegraphics[width=.4\linewidth]{house.eps}
  \captionof{figure}{A graph $G$ with $\mad(G) = \frac{7}{3}$ \\ and $\sci > 6$.}
  \label{fig:house}
\end{minipage}%
\begin{minipage}{.5\textwidth}
  \centering
  \begin{tikzpicture}[scale=1]

\draw (-1.5,0)--(1.5,0)
(-1.5,0) node[insep]{}
(-.5,0) node[insep]{}
(.5,0) node[insep]{}
(1.5,0) node[insep]{}
(90:1.5) node[insep]{}
(270:1.5) node[insep]{}
(-1.5,0)--(90:1.5)
(90:1.5)--(1.5,0)
(1.5,0)--(270:1.5)
(270:1.5)--(-1.5,0)
(90:1.5)--(2.5,1.5)
(2.5,1.5)--(2.5,-1.5)
(270:1.5)--(2.5,-1.5)
(2.5,1.5) node[insep]{}
(2.5,-1.5) node[insep]{}
;

\end{tikzpicture}
  %\includegraphics[width=.8\linewidth]{diamond.eps}
  \captionof{figure}{A graph $G$ with $\mad(G) = \frac{5}{2}$ \\ and $\sci > 7$.}
  \label{fig:diamond}
\end{minipage}
\end{figure}


Theorem \ref{theorem:Hoc} and Proposition \ref{prop:mad} yield the following corollary.

\begin{corollary}[Hocquard \textit{et al.} \cite{Hocquard13}]
Let $G$ be a subcubic planar graph with girth $g$.

\begin{enumerate}
\item If $g \geq 14$, then $\sci \leq 6$.
\item If $g \geq 10$, then $\sci \leq 7$.
\item If $g \geq 8$, then $\sci \leq 8$.
\end{enumerate}
\end{corollary}

Note that no non-trivial sparsity condition on a graph $G$ with maximum degree $d$ will guarantee that $\sci < 2d - 1$ 
% since any graph having two adjacent vertices of degree $d$ requires at least $2d-1$ colors to strongly edge-color the graph.
since every graph $H$ with two adjacent vertices of degree $d$ has $\chi_{s}'(H) \geq 2d-1$. 
We give sparsity conditions that imply a subcubic planar graph has strong chromatic index at most five and a subquartic planar graph has strong chromatic index at most seven.
Previous work in this direction was initiated by Borodin and Ivanova~\cite{BI}, Chang, Montassier, P\v{e}cher, and Raspaud~\cite{CMPR}, and most recently extended by Wang and Zhao~\cite{WZ}.
The current-best bounds are given by the following two results.

\begin{theorem}[Borodin and Ivanova~\cite{BI}]\label{theorem:bi}
Let $G$ be a subcubic graph.
\begin{enumerate}
\item If $G$ has girth at least $9$ and $\mad(G) < 2 + \frac{2}{23}$, then $\chi_s'(G) \leq 5$.
\item If $G$ is planar and has girth at least $41$, then $\chi_s'(G) \leq 5$.
\end{enumerate}
\end{theorem}

\begin{theorem}[Wang and Zhao~\cite{WZ}]\label{theorem:wz}
Fix $d \geq 4$ and let $G$ be a graph with $\Delta(G) \leq d$.
\begin{enumerate}
\item If $G$ has girth at least $2d-1$ and $\mad(G) < 2 + \frac{2}{6d-7}$, then $\chi_s'(G) \leq 2d-1$.
\item If $G$ is planar and has girth at least $10d-4$, then $\chi_s'(G) \leq 2d-1$.
\end{enumerate}
\end{theorem}

%This is the last interesting case to consider, as two adjacent vertices of degree three will force $\sci \geq 5

%\begin{figure}[ht]
%
%	\centering
%	\begin{tikzpicture}[scale=.5]
%
%\draw (0,0) node[insep]{}
%(0,4) node[insep]{}
%(9,4) node[insep]{}
%(9,0) node[insep]{}
%(2,2) node[insep]{}
%(7,2) node[insep]{};
%
%\draw (0,0)--(2,2)
%(0,4)--(2,2)
%(2,2)--(7,2)
%(7,2)--(9,4)
%(7,2)--(9,0);
%
%\end{tikzpicture}
%	%\includegraphics[height = 1.5in]{tree.eps}
%	
%	\caption{ A graph $G$ with $\sci \geq 5$.}
%	\label{tree}
%\end{figure}





One barrier to proving sparsity conditions that imply $\sci \leq 5$ is that there exist graphs $G$ with $\mad(G) = 2$ and $\sci = 6$.
Let $S_3$ be a triangle with pendant edges at each vertex, and let $S_4$ be a $4$-cycle with pendant edges at two adjacent vertices. For $k \geq 5$, let $S_k$ be a $k$-cycle with pendant edges at each vertex.
Each of $S_3$, $S_4$ and $S_7$ have maximum average degree $2$ and strong chromatic index at least 6, see Figure~\ref{fig:S3S4S5}. However, these graphs are 6-critical with respect to $\sci$, as the removal of any edge from $S_3$, $S_4$ or $S_7$ results in a graph that has a strong edge-coloring using five colors. 

\begin{figure}[h]
\centering
{\usetikzlibrary[topaths]

\tikzset{
insep/.style={inner sep=2pt, outer sep=0pt, circle,fill}, 
free/.style={inner sep=2pt, outer sep=0pt, circle,fill=gray,draw}, 
extra/.style={inner sep=2pt, outer sep=0pt, circle,fill=white,draw}, 
}

%%%%%%%%%%%%%%%%%%% 

\begin{tikzpicture}[scale=1]
\begin{scope}
\draw
\foreach \x in {0,1,2} { (0,0) ++ (90+\x*120:1) node[insep] (x\x){} -- ++(90+\x*120:0.8) node[insep]{} }
(x0)--(x1)--(x2)--(x0)
;
\draw(0,0) ++(0,-2) node{$S_3$};
\end{scope}

\begin{scope}[xshift=4cm]
\draw
\foreach \x in {0,1,2,3} { (0,0) ++ (45+\x*90:1) node[insep] (x\x){}  }
(x0)--(x1)--(x2)--(x3)--(x0)
(x0) -- ++(45+0*90:0.8) node[insep]{}
(x3) -- ++(45+3*90:0.8) node[insep]{}
;
\draw(0,0) ++(0,-2) node{$S_4$};
\end{scope}

\begin{scope}[xshift=8cm]
\draw
\foreach \x in {0,1,...,6} { (0,0) ++ (90+\x*360/7:1) node[insep] (x\x){} --  ++ (90+\x*360/7:0.8) node[insep]{}  }
(x0)--(x1)--(x2)--(x3)--(x4)--(x5)--(x6)--(x0)
;
\draw(0,0) ++(0,-2) node{$S_7$};
\end{scope}
\end{tikzpicture}



%%%%%%%%%%%%%%%%%%% 

}
\caption{Exceptions in Theorem~\ref{theorem:sparse}.\label{fig:S3S4S5}}
\end{figure}

Our main theorem demonstrates that if these few graphs are avoided, and the maximum average degree is not too large, then we can find a strong 5-edge-coloring, improving Theorem~\ref{theorem:bi}.

\begin{theorem}\label{theorem:sparse}
Let $G$ be a subcubic graph.
\begin{enumerate}
\item If $G$ does not contain $S_3$, $S_4$, or $S_7$ and $\mad(G) < 2 + \frac{1}{7}$, then $\sci \leq 5$.
\item If $G$ is planar and has girth at least $30$, then $\sci \leq 5$.
\end{enumerate}
%    If $G$ is a subcubic graph with $\mad(G) < 2+\frac{1}{7}$ that does not contain $S_3$, $S_4$, or $S_7$, then $\sci \leq 5$.
\end{theorem}

The bound in Theorem~\ref{theorem:sparse} is likely not sharp, but is close to optimal.
The graph in Figure~\ref{fig:thetaexample} is subcubic, avoids $S_3$, $S_4$, and $S_7$, and satisfies both $\sci = 6$ and $\mad(G) = 2 + \frac{1}{6}$.
%However, using the bound in Proposition~\ref{prop:mad}, this results in an immediate girth condition for a planar graph $G$ that implies $\sci \leq 5$.  
%This result provides a partial affirmation to part (6) of Conjecture \ref{con:Faud} when applied to planar bipartite graphs.  

\begin{figure}[htp]
\centering
\tikzset{
insep/.style={inner sep=2pt, outer sep=0pt, circle,fill}, 
}


%%%%%%%%%%%%%%%%%%% 
\begin{tikzpicture}[scale=1]
\draw
(0,0) node[insep](a){} 
(5,0) node[insep](b){}

(a) to[bend left=50] node[insep,pos=0.25](x){} node[insep,pos=0.50](y){} node[insep,pos=0.75](z){}  (b)
(x)-- ++(90:0.5)node[insep]{}
(y)-- ++(90:0.5)node[insep]{}
(z)-- ++(90:0.5)node[insep]{}

(a) to[bend right=50] node[insep,pos=0.25](x){} node[insep,pos=0.50](y){} node[insep,pos=0.75](z){}  (b)
(x)-- ++(-90:0.5)node[insep]{}
(y)-- ++(-90:0.5)node[insep]{}
(z)-- ++(-90:0.5)node[insep]{}

(a) to node[insep,pos=0.20](x){} node[insep,pos=0.40](y){} node[insep,pos=0.60](z){} node[insep,pos=0.80](w){}  (b)
(x)-- ++(90:0.5)node[insep]{}
(y)-- ++(90:0.5)node[insep]{}
(z)-- ++(90:0.5)node[insep]{}
(w)-- ++(90:0.5)node[insep]{}
;

\draw
;
%\draw(d) ++(0,-2) node{$\mathrm{mad}(G) = 2+\frac{2}{9} $};
\end{tikzpicture}


\caption{\label{fig:thetaexample}The graph $G = \ex_3(\Theta_{3,3,4})$ with $\mad(G) = 2 + \frac{1}{6}$ and $\sci = 6$.} %\textbf{TODO: Add reference from text.}}
\end{figure}

%\begin{theorem}
%If $G$ is a subcubic planar graph of girth at least $30$, then $\sci \leq 5$.
%\end{theorem}

Using similar methods, we improve the bounds in Theorem~\ref{theorem:wz} when $d = 4$.

\begin{theorem}\label{theorem:sparse4}
Let $G$ be a subquartic graph. % ($\Delta(G) \leq 4$).
\begin{enumerate}
\item If $G$ has girth at least $7$ and  $\mad(G) < 2 + \frac{2}{13}$, then $\chi_s'(G) \leq 7$.
\item If $G$ is planar and has girth at least $28$, then $\chi_s'(G) \leq 7$.
\end{enumerate}
\end{theorem}


We also consider a list variation of the strong chromatic index of $G$, first introduced by Vu~\cite{vu}. 
A {\it strong list edge-coloring} of a graph $G$ is an assignment of lists to $E(G)$ such that a strong edge-coloring can be chosen from the lists at each edge. 
The minimum $k$ such that a graph $G$ can be strongly list edge-colored using any lists of size at least $k$ on each edge is the {\it strong list chromatic index} of $G$, denoted $\scil$. 
Borodin and Ivanova~\cite{BI} asked if there are sparsity conditions that imply $\scil \leq 2d-1$ for a planar graph $G$ with maximum degree $d$.
We generalize the bounds in Theorem~\ref{theorem:bi} to apply to list coloring.

\begin{theorem}\label{theorem:mainlist}
Let $G$ be a subcubic graph.
\begin{enumerate}
\item If $G$ has girth at least $9$ and $\mad(G) < 2 + \frac{2}{23}$, then $\scil \leq 5$.
\item If $G$ is planar and has girth at least $41$, then $\scil \leq 5$.
\end{enumerate}
\end{theorem}

The proofs of Theorems~\ref{theorem:sparse}, \ref{theorem:sparse4}, and \ref{theorem:mainlist} use the discharging method.
We begin by proving Theorem~\ref{theorem:mainlist} in Section~\ref{sec:list} as the proof is shorter and the one reducible configuration is used again in the proof of Theorem~\ref{theorem:sparse} in Section~\ref{sec:sparse}.


\subsection{Preliminaries and Notation}


Throughout this paper we will only consider simple, finite, undirected graphs. 
We refer to \cite{west} for any undefined definitions and notation.
%For any graph $G$, we let $E(G)$ denote the edge set, $V(G)$ denote the vertex set, and $\Delta(G)$ denote the maximum degree. 
A graph $G$ has vertex set $V(G)$, edge set $E(G)$, and maximum degree $\Delta(G)$.
%We say $G$ is {\it subcubic} if $\Delta(G) \leq 3$. 
%For $S \subseteq V(G)$, let $G[S]$ denote the subgraph of $G$ induced by $S$.

If a vertex $v$ has degree $j$ we refer to it as a {\it $j$-vertex}, and if $v$ has a neighbor that is a $j$-vertex, we say it is a {\it $j$-neighbor} of $v$. When $G$ is planar let $F(G)$ denote the set of faces of $G$, and $\ell(f)$ denote the length of a face $f$. The {\it girth} of a graph $G$ is length of its shortest cycle.
A graph $G$ is $\{a,b\}$-regular if for every $v$ in $G$, the degree of $v$ is either $a$ or $b$. 
%Every graph with maximum degree $d$ is a subgraph of a $\{1,d\}$-regular graph.
Every graph $G$ with maximum degree $d$ is contained in a prescribed $\{1,d\}$-regular graph, denoted $\ex_d(G)$, the {\it $d$-expansion} of $G$. 
To construct $\ex_d(G)$, add $d-d(v)$ pendant edges to each vertex $v$ in $G$ where $d(v) \in \{2,\dots, d\}$. 
Additionally, let the {\it contracted graph} of $G$, denoted by $\ct(G)$, be the graph obtained by deleting all 1-vertices of $G$. 
A vertex $v$ in $G$ is a \emph{$2\bla$-vertex} if $v$ is a 2-vertex in $\ct(G)$.
Thus, for the remainder of the paper a vertex $v$ is a \emph{$k^+$-vertex} in $G$ if it has degree at least $k$ in $\ct(G)$.

We will make use of the discharging method for some of our results.
For an introduction to this method, see the survey by Cranston and West~\cite{CW}.
We will directly use two standard results that can be proven using this method.
Both of Theorems~\ref{theorem:bi} and \ref{theorem:wz} rely on Lemmas~\ref{lma:cw} and \ref{lma:nrs}.

Let $G$ be a graph and $\ct(G$) be the contracted graph.
An \emph{$\ell$-thread} is a path $v_1\dots v_\ell$ in $\ct(G)$ where each $v_i$ is a $2\bla$-vertex.

\begin{lemma}[Cranston and West~\cite{CW}]\label{lma:cw}
If $G$ is a graph with girth at least $\ell+1$ and $\mad(G) < 2 + \frac{2}{3\ell - 1}$, then $\ct(G)$ contains a 1-vertex or an $\ell$-thread.
\end{lemma}

\begin{lemma}[Ne\v{s}et\v{r}il, Raspaud, and Sopena~\cite{NRS}]\label{lma:nrs}
If $G$ is a planar graph with girth at least $5\ell + 1$, then $\ct(G)$ contains a 1-vertex or an $\ell$-thread.
\end{lemma}

\section{Strong List Edge-Coloring of Subcubic Graphs}\label{sec:list}

In this section, we prove Theorem~\ref{theorem:mainlist}.
Our proof uses the discharging method, wherein we assign an initial charge to the vertices and faces of a theoretical minimal counterexample. This initial charge is then disbursed according to a set of discharging rules in order to draw a contradiction to the existence of such a minimal counterexample. 
%Let $C$ be a $\{1,3\}$-regular graph and let $D$ be a non-empty subset of $V(C)$. 
%We say that $(C,D)$ is a {\it $5$-list reducible configuration} if for every 5-list assignment of $C$, every strong list edge-coloring of $C-E(C[D])$ extends to a strong list edge-coloring of $C$. 
%A subcubic graph $G$ {\it contains} a list reducible configuration $(C,D)$ if $C[D]$ is an induced subgraph of $\ex_3(G)$. %there exists a homomorphism $\varphi$ from $C$ to $\ex_3(G)$ where $\varphi|_D$ is an injection.
%A graph $G$ is {\it reducible} if it contains a proper subgraph $H$ such that $G-H$ can be strongly edge-colored and this strong edge-coloring can be extended to $G$. We also say that $G$ is reducible when $G-H$ has a strong list edge-coloring that can be extended to a strong list edge-coloring of $G$. Thus, any vertex minimal counterexample cannot contain a reducible subgraph.
%We say a configuration is {\it reducible} if it does not occur in a vertex minimal subcubic planar graph $G$ with girth(G) $\geq 41$ and $\scil > 5$, that is, a vertex minimal counterexample. 
We will often make use of the following, which is another simple and well known application of Euler's Formula.

\begin{proposition}
\label{prop:sum}
In a planar graph $G$,

$$\sum_{f \in F(G)} ( \ell(f) - 6 ) + \sum_{v \in V(G)} (2d(v) - 6) = -12.$$

\end{proposition}

We will also use the Combinatorial Nullstellensatz, which will be applied to show we can extend certain list colorings. %We will assign variables to edges and determine a polynomial which is zero whenever edges within distance two receive the same label. 

\begin{theorem}[Combinatorial Nullstellensatz \cite{Alon95}]\label{CN}
Let $f$ be a polynomial of degree $t$ in $m$ variables over a field $\mathbb{F}$. If there is a monomial $\prod x_i^{t_i}$ in $f$ with $\sum t_i=t$ whose coefficient is nonzero in $\mathbb{F}$, then $f$ is nonzero at some point of $\prod S_i$, where each $S_i$ is a set of $t_i+1$ distinct values in $\mathbb{F}$.
\end{theorem}

Theorem~\ref{theorem:mainlist}(2) follows from the following strengthened theorem.

\begin{theorem}
Let $G$ be a planar $\{1,3\}$-regular graph of girth at least $41$, and let $p \in V(G)$.
Assign distinct colors to the edges incident to $p$ and let $L$ be a $5$-list-assignment to the remaining edges of $G$.
There exists a strong edge-coloring $c$ where $c(e) \in L(e)$ for all $e \in E(G)$.
\end{theorem}

\begin{proof}
For the sake of contradiction, select $G$, $p$, $c$, and $L$ as in the theorem statement, and assume there does not exist a strong edge-coloring of $E(G)$ using colors from $L$.
In this selection, minimize $n(G)$.
Note that $G$ is connected and $e(G) > 5$.
We can further assume that $d(p) > 1$, since if $d(p)=1$ and $\{p'\}=N(p)$ then we can instead color the edges incident to $p'$.

\begin{lemma}\label{lma:cutedge}
There does not exist a cut-edge $uv$ such that $d(u) = d(v) = 3$.
\end{lemma}

%
%\begin{figure}[h]
%	\centering
%	\begin{tikzpicture}[scale=1]
%
%\draw (0,0) circle (2cm)
%(9,0) circle (2cm)
%(2,0) node[insep, label=left:{$u$}]{}
%(7,0) node[insep,label=right:{$v$}]{}
%(3,0) node[insep]{}
%(6,0) node[insep]{} 
%(2,0)--(3,0)
%(6,0)--(7,0)
%(2,0)--(.75,1.25)
%(2,0)--(.75,-1.25)
%(3,0)--(4.25,1.25)
%(3,0)--(4.25,-1.25)
%(6,0)--(4.75,1.25)
%(6,0)--(4.75,-1.25)
%(7,0)--(8.25,1.25)
%(7,0)--(8.25,-1.25)
%(.75,1.25) node[insep]{}
%(.75,-1.25) node[insep]{}
%(4.25,1.25) node[insep]{}
%(4.25,-1.25) node[insep]{}
%(4.75,1.25) node[insep]{}
%(4.75,-1.25) node[insep]{}
%(8.25,1.25) node[insep]{}
%(8.25,-1.25) node[insep]{}
%(-.2,0) node{$G_1$}
%(9.2,0) node{$G_2$}
%(1.1,.6) node{$a_1$}
%(1.1,-.6) node{$a_2$}
%(3.9,.6) node{$a_4$}
%(3.9,-.6) node{$a_5$}
%(2.5,-.2) node{$a_3$}
%(5.1,.6) node{$b_1$}
%(5.1,-.6) node{$b_2$}
%(6.5,-.2) node{$b_3$}
%(7.9,.6) node{$b_4$}
%(7.9,-.6) node{$b_5$}
%;
%
%\end{tikzpicture}
%	%\includegraphics[height=2in]{G1G2.eps}
%	\caption{The modified components $G_1$ and $G_2$.}
%\end{figure}

\begin{proof}
Suppose that $G$ contains a cut-edge $uv$ with $d(u) = d(v) = 3$.
There are exactly two components in $G - uv$, call them $G_1$ and $G_2$, with $u \in V(G_1)$ and $v \in V(G_2)$.
Without loss of generality, $p \in V(G_1)$.
For each $i \in \{1,2\}$, let $G_i' = G_i + uv$.

Since $d(v) = 3$, $n(G_1') < n(G)$. 
Thus there is a strong edge-coloring of $G_1'$ using the 5-list-assignment $L$.
Next, color the other two edges incident to $v$ using colors distinct from those on the edges incident to $u$.
Now, $G_2'$ is a subcubic planar graph of girth at least 41 with distinctly colored edges about the vertex $v$ and $n(G_2') < n(G)$.
Thus, there is an extension of the coloring to $G_2'$.

The colorings of $G_1'$ and $G_2'$ form a strong edge-coloring of $G$, a contradiction.
\end{proof}

Define a \emph{$k$-caterpillar} to be a $k$-thread $v_1,\dots,v_k$ in $G$ where $p \notin \{v_1,\dots,v_k\}$.
%Define a \emph{$k$-caterpillar} to be the graph $C$ given by a path on vertices $\{v_0,\ldots,v_{k+1}\}$ such that for each $i \in \{1,\dots,k\}$ the vertex $v_i$ has a distinct neighbor $v_i'$ with degree 1, for each $i \in \{0,k+1\}$ the vertex $v_i$ has two distinct neighbors $v_i'$ and $u_i'$ with degree 1, and let $D=\{v_1,\ldots,v_k,v_1',\ldots,v_k'\}$. 
Figure~\ref{8cat} is an $8$-caterpillar.

\begin{figure}[h]

	\centering
	\begin{tikzpicture}[scale=1]

\draw (0,0)--(9,0)
(0,0) node[insep]{}
(9,0) node[insep]{};

\foreach \x in {1,2,...,8}{
\draw (\x,0)--(\x,1)
(\x,0) node[free]{}
(\x,1) node[extra]{};
\node at (\x,-0.35) {$v_{\x}$};
\node at (\x,1.5) {$v_{\x}'$};
};


\draw (9,0)--(10,.75)
(9,0)--(10,-.75)
(0,0)--(-1,.75)
(0,0)--(-1,-.75);


\draw (-1,-.75) node[insep]{};
\draw (-1,.75) node[insep]{};
\draw (10,-.75) node[insep]{};
\draw (10,.75) node[insep]{};
\node at (-0.5,0) {$v_{0}$};
\node at (9.5,0) {$v_{9}$};
\node at (10.35,.75) {$v_9'$};
\node at (10.35,-.75) {$u_9'$};
\node at (-1.35,.75) {$v_0'$};
\node at (-1.35,-.75) {$u_0'$};
\end{tikzpicture}
	%\includegraphics[height = 1.25in]{caterpillar.eps}
	
	\caption{An 8-caterpillar.}
	\label{8cat}
\end{figure}

\begin{lemma}\label{lma:caterpillar}
$G-p$ does not contain an $8$-caterpillar.
\end{lemma}

%\begin{lem}
%\label{lem:8cat}
%The 8-caterpillar is a reducible configuration.
%\end{lem}

\begin{proof} 
%Suppose $G$ is a vertex minimal $\{1,3\}$-regular planar graph with $\girth(G) \geq 41$ and $\scil > 5$ containing an 8-caterpillar. %Add phantom edges in for each 2-vertex in the 8-caterpillar, so that each vertex in the 8-caterpillar becomes a 3-vertex. A strong edge-coloring of the modified graph produces a strong edge-coloring of the original graph by removing the phantom edges. 
We will show that if $G-p$ contains an 8-caterpillar, then $G$ has a strong edge $L$-coloring.
If $v_1,\dots,v_8$ form an 8-caterpillar, then let $v_i'$ be the 1-vertex adjacent to $v_i$, $v_0$ and $v_9$ be the other neighbors of $v_1$ and $v_8$. 
For $i \in \{0,9\}$, let $v_i'$ and $u_i'$ be the neighbors of $v_i$ other than $v_1$ or $v_8$.
% by a path on vertices $\{v_0,\ldots,v_{k+1}\}$ such that for each $i \in \{1,\dots,k\}$ the vertex $v_i$ has a distinct neighbor $v_i'$ with degree 1, for each $i \in \{0,k+1\}$ the vertex $v_i$ has two distinct neighbors $v_i'$ and $u_i'$ with degree 1, and let $D=\{v_1,\ldots,v_k,v_1',\ldots,v_k'\}$. 

By removing all edges incident to $v_2,\dots, v_7$ and $v'_1,\dots,v'_8$, as well as any isolated vertices that are produced, we obtain a graph $G'$ with fewer vertices than $G$, so we can strongly edge-color $G'$ with 5 colors. 
We fix such a coloring of $G'$ and generate a contradiction by extending this coloring to a strong edge-coloring of $G$. 
Suppose that $c_1, \dots, c_6$ are the colors of the edges incident to the vertices $v_0$ and $v_9$, and assign variables $y_1, \dots, y_8$ to the pendant edges, and variables $x_1, \dots, x_7$ to the interior edges as shown in Figure \ref{fig:lcat}.

\begin{figure}[h]
	\centering
		\begin{tikzpicture}[scale=1]

\draw (0,0)--(9,0)
(0,0) node[insep]{}
(9,0) node[insep]{};

\foreach \x in {1,2,...,8}{
\draw (\x,0)--(\x,1)
(\x,0) node[free]{}
(\x,1) node[extra]{};
};

\draw (9,0)--(10,.75)
(9,0)--(10,-.75)
(0,0)--(-1,.75)
(0,0)--(-1,-.75);

\foreach \x in {1,2,...,8}{
\draw (\x-.2,.5) node{$y_{\x}$};
}

\foreach \x in {1,2,...,7}{
\draw (\x+.5, -.2) node{$x_{\x}$}; 
}

\draw
(.5,-.2) node{$c_{3}$}
(8.5,-.2) node{$c_{4}$}
(-.25,.6) node{$c_1$}
(-.25,-.6) node{$c_2$}
(9.25,.6) node{$c_5$}
(9.25,-.6) node{$c_6$}
;

\draw (-1,-.75) node[insep]{};
\draw (-1,.75) node[insep]{};
\draw (10,-.75) node[insep]{};
\draw (10,.75) node[insep]{};

\end{tikzpicture}
	%\includegraphics[height = 1.25in]{caterpillarlabel.eps}
	\caption{The assignment of colors and variables to the 8-caterpillar.}
\label{fig:lcat}
\end{figure}

Identifying the conflicts between variables and colors produces the following polynomial,
\begin{align*}
f(y_1, \dots, y_8,x_1,\dots, x_7) &= (y_2 - c_3)(x_2 - c_3)(y_7 - c_4)(x_6 - c_4) \\
&\quad\cdot 
\prod_{i=1}^3(x_1 - c_i)\prod_{i=1}^3(y_1 - c_i) \prod_{i=4}^6 (x_7 - c_i) \prod_{i=4}^6 (y_8 - c_i)\\ 
&\quad\cdot \prod_{j -i  \in \{1,2\}}(x_i-x_j)  \prod_{j-i = 1}(y_i - y_j)\prod_{i - j \in \{-1,0,1,2\}} (y_i - x_j). 
\end{align*}

We will use the Combinatorial Nullstellensatz to show that there is an assignment of colors $\hat{c}_1,\dots, \hat{c}_8$ and $c_1',\dots, c_7'$ such that $f(\hat{c}_1,\dots,\hat{c}_8,c_1',\dots,c_7')\ne 0$.  Such an assignment of colors would extend the inductive coloring of $G-p$ to a strong edge-coloring of $G$. If the coefficient of \[(x_{1}~ x_{2}~ x_{3}~ x_{4} ~x_{5} ~x_{6} ~x_{7} ~y_{1} ~y_{2} ~y_{3} ~y_{4} ~y_{5} ~y_{6} ~y_{7} ~y_{8})^4\] is nonzero, then there are values from $L$ for $x_1,\ldots,x_7,y_1,\ldots,y_8$ such that $f$ is nonzero by Theorem~\ref{CN}. 
Using the Magma algebra system~\cite{magma}, this monomial has coefficient $-2$, and thus there is a strong edge-coloring using the 5-list assignment\footnote{All source code and data is available at \url{http://www.math.iastate.edu/dstolee/r/scindex.htm}.}.  %To do this we show there exists such an assignment of colors for which the value of $f$, when evaluated at that assignment, is nonzero. The existence will follow from an application of the Combinatorial Nullstellensatz as stated in Theorem \ref{CN}. The monomial we are interested in showing has a nonzero coefficient is $$(x_{1}~ x_{2}~ x_{3}~ x_{4} ~x_{5} ~x_{6} ~x_{7} ~y_{1} ~y_{2} ~y_{3} ~y_{4} ~y_{5} ~y_{6} ~y_{7} ~y_{8})^4.$$ Using the Magma algebra system we were able to determine that the coefficient on the monomial is $-2$, hence there exists an assignment of colors to the variables that produces a strong edge-coloring. 
Thus, the 8-caterpillar does not exist in a vertex minimal counterexample. %, and so is a reducible configuration, by Combinatorial Nullstellensatz.
\end{proof}

Note that the proof in Lemma~\ref{lma:caterpillar} cannot be extended to exclude a 7-caterpillar in $G$, as there exists a 5-coloring of the external edges that does not extend to the caterpillar, even when the lists are all the same.

To complete the proof, we apply a discharging argument\footnote{Our discharging approach is similar to the proof of Lemma~\ref{lma:nrs} where $\ell = 8$, but some care is needed due to the precolored vertex $p$.} to $\ct(G)$. %Let $H$ be the plane graph given by deleting all 1--vertices from $G$.
First, observe that by Lemma~\ref{lma:cutedge}, $\ct(G)$ is 2-connected and so every face is a simple cycle of length at least 41.
Also observe that by Lemma~\ref{lma:caterpillar}, $\ct(G)$ does not contain a path of length 8 where every vertex is of degree 2, unless one of those vertices is $p$.

Assign charge $2d(v)-6$ to every vertex $v \neq p$, charge $\ell(f) - 6$ to every face $f$, and charge $2d(p)+5$ to $p$. 
By Proposition~\ref{prop:sum}, the total amount of charge on $\ct(G)$ is $-1$. 
Apply the following discharging rules.

\begin{enumerate}[(R1)]
    \item For every $v\in G-p$, if $v$ is a $2$--vertex, $v$ pulls  1 from each incident face.
    
    \item If $p$ is a $2$--vertex, then $p$ gives  $\frac{9}{2}$ to each incident face.
\end{enumerate}

Observe that every vertex has nonnegative final charge after this discharging process.
It remains to show that every face has nonnegative charge.

Let $f$ be a face, and let $r_2$ be the number of 2--vertices on the boundary of $f$, not counting $p$, and consider two cases.

\textbf{Case 1}: $d(p)=3$ or $p$ is not adjacent to $f$.

In this case, $p$ does not give charge to $f$, and therefore $f$ has charge $\ell(f) - r_2 - 6$ after discharging. 
Also, the boundary of $f$ does not contain a path of length 8 containing only vertices of degree 2, thus $r_2 \leq \left\lfloor \frac{7}{8}\ell(f)\right\rfloor$. 
Since $\ell(f) \geq 41$, we have
\[
	\ell(f) - r_2 - 6 \geq \ell(f) - \left\lfloor \frac{7}{8}\ell(f)\right\rfloor - 6 \geq 0.
\]

\textbf{Case 2}: $d(p)=2$ and $p$ is adjacent to $f$.

By (R2), $p$ gives charge $\frac{9}{2}$ to $f$, so that $f$ has charge $\ell(f)  - r_2 - \frac{3}{2}$ after discharging.
The boundary of $f$ does not contain a path of length 8 containing only vertices of degree 2, except when using $p$, so, $r_2 \leq \left\lfloor \frac{7}{8}\ell(f)\right\rfloor$.
Since $\ell(f) \geq 41$, we have
\[
	\ell(f) - r_2 - \frac{3}{2} \geq \ell(f) - \left\lfloor \frac{7}{8}\ell(f)\right\rfloor - \frac{3}{2} \geq 0.
\]
Thus, all vertices and faces have nonnegative charge, contradicting Proposition~\ref{prop:sum}.
\end{proof}

Theorem~\ref{theorem:mainlist}(1) follows quickly from Lemmas~\ref{lma:cw} and \ref{lma:caterpillar}.

\begin{proof}[Proof of Theorem~\ref{theorem:mainlist} (1).]
Suppose that $G$ is a minimal counterexample, and $L$ is a 5-list-assignment on the edges of $G$ that cannot be strongly colored.
For $\ell = 8$, we have $\girth(G) \geq \ell + 1$ and $\mad(G) < 2 + \frac{2}{3\ell-1}$, so Lemma~\ref{lma:cw} implies that $ct(G)$ contains a 1-vertex or an 8-thread.

If $\ct(G)$ contains a 1-vertex $v$, then let $S$ be the set of 1-vertices adjacent to $v$; there is at least one or $v$ would be pruned from $\ct(G)$.
Note also that $|S| \in \{1,2\}$.
By minimality of $G$, there is an $L$-coloring of $E(G-S)$.
For each $u \in S$, the edge $uv$ has five possible colors and at most three edges at distance at most two that have assigned colors.
Thus, there are at most two uncolored edges and each have at least two available colors, giving a strong $L$-coloring of $E(G)$.

Therefore, $\ct(G)$ has an 8-thread, which gives an 8-caterpillar in $\ex_2(G)$.
Observe that the proof of Lemma \ref{lma:caterpillar} demonstrates that a strong $L$-coloring of $E(G)$ exists,  a contradiction.
\end{proof}

\section{Strong Edge-Coloring of Sparse Graphs}\label{sec:sparse}

In this section, we prove Theorems~\ref{theorem:sparse} and \ref{theorem:sparse4}.

Let $G$ be a graph with maximum degree $\Delta(G) \leq d$. 
%
For a vertex $v$ in $\ct(G)$ denote by $N_3(v)$ the set of $3^+$-vertices $u$ where $\ct(G)$ contains a path $P$ from $u$ to $v$ where all internal vertices of $P$ are $2\bla$-vertices.  
For $u \in N_3(v)$, let $\mu(v,u)$ be the number of paths from $v$ to $u$ whose internal vertices have degree 2 in $\ct(G)$. 
For a 3-vertex $v$, let the \emph{responsibility set}, denoted $\Resp(v)$, be the set of $2\bla$-vertices that appear on the paths between $v$ and the vertices in $N_3(v)$.

Let $D$ be a subgraph of $G$. We call $D$ a \emph{$k$-reducible configuration} if there exists a subgraph $D'$ of $D$ such that
any  strong $k$-edge-coloring of $G-D'$ can be extended to a strong $k$-edge-coloring of $G$.
One necessary property for the selection of $D'$ is that no two edges that remain in $G-D'$ can have distance at most two in $G$ but distance strictly larger than two in $G - D'$.
In the next subsection we describe several reducible configurations. 
%In all cases, the reducibility was verified using computer by enumerating possible colorings.


\subsection{Reducible Configurations}

This subsection contains description of four types of reducible configurations. 
Each configuration is described in terms of how it appears within $\ct(G)$ where $G$ is a graph with maximum degree $\Delta(G) \leq d$ for some $d \geq 4$.


Let $t$ be a positive integer.
The \emph{$t$-caterpillar} is formed by two $3^+$-vertices $v_0$ and $v_{t+1}$ with a path $v_0v_1\dots v_tv_{t+1}$ where each $v_i$ is a $2\bla$-vertex for every $i \in \{1,\dots,t\}$.


Let $t_1,\dots, t_k$ be nonnegative integers.
A configuration $Y(t_1,\dots,t_k)$ is formed by a $k^+$-vertex $v$ and $k$ internally disjoint paths of lengths $t_1+1,\dots,t_k+1$ with $v$ as a common endpoint, where the internal vertices of the paths are $2\bla$-vertices.
We call such configuration a \emph{$Y$-type configuration about $v$}, see Figure~\ref{fig:Y}.



\begin{figure}[h]
\centering
{\usetikzlibrary[topaths]

\tikzset{
insep/.style={inner sep=2pt, outer sep=0pt, circle,fill}, 
free/.style={inner sep=2pt, outer sep=0pt, circle,fill=gray,draw}, 
extra/.style={inner sep=2pt, outer sep=0pt, circle,fill=white,draw}, 
}

%%%%%%%%%%%%%%%%%%% 

\begin{tikzpicture}[scale=1]
\draw
(0,0) node[insep,label=below:{$v$}](a){} 
(a)++(90:2)  node[insep](b){} 
(a)++(210:2)  node[insep](c){} 
(a)++(90-120:2)  node[insep](d){} 
(a) to node[free,pos=0.2](x1){} node[free,pos=0.40](x2){} node[free,pos=0.6](x3){} node[free,pos=0.8](x4){}  (b)
(a) to  node[free,pos=0.25](x5){} node[free,pos=0.50](x6){} node[free,pos=0.75](x7){}   (c)
(a) to  node[free,pos=0.333](x8){} node[free,pos=0.666](x9){}    (d)
;
\draw[line width=1pt]
(b) -- (x4)
(b) -- ++(150:0.7)
(b) -- ++(30:0.7)
(c) -- (x7)
(c) -- ++(270:0.7)
(c) -- ++(150:0.7)
(d) -- (x9)
(d) -- ++(30:0.7)
(d) -- ++(270:0.7)
;
\draw
\foreach \x in {5,6,...,9} { (x\x) -- ++(0,0.5) node[extra]{} }
\foreach \x in {1,2,...,4} { (x\x) -- ++(40:0.5) node[extra]{} }
;
\draw(0,0) ++(0,-2) node{$Y(2,3,4)$};
\end{tikzpicture}

%%%%%%%%%%%%%%%%%%% 

}
\caption{The configuration $Y(t_1,t_2,t_3)$.}\label{fig:Y}
\end{figure}

A configuration $H(t_1,t_2;r;s_1,s_2)$ is formed by two 3-vertices $u$ and $v$
and 5 internally disjoint paths of lengths   $t_1+1$, $t_2+1$, $r+1$, $s_1+1$, and $s_2+1$, 
where the internal vertices of the paths are $2\bla$-vertices. The paths of lengths
$t_1+1$ and $t_2+1$ have  $v$ as an endpoint, the path of length $r+1$ has  $u$ and $v$ as endpoints 
and the paths of lengths $s_1+1$ and $s_2+1$ have $u$ as an endpoint.
We call such configuration an \emph{$H$-type configuration about $v$ and $u$}, see Figure~\ref{fig:H}.


\begin{figure}[h]
\centering
{\usetikzlibrary[topaths]

\tikzset{
insep/.style={inner sep=2pt, outer sep=0pt, circle,fill}, 
free/.style={inner sep=2pt, outer sep=0pt, circle,fill=gray,draw}, 
extra/.style={inner sep=2pt, outer sep=0pt, circle,fill=white,draw}, 
}


\begin{tikzpicture}[scale=1]
\draw
(-2,0) node[insep,label=left:{$v$}](a){} 
(2,0) node[insep,label=right:{$u$}](b){}
(a) to node[free,pos=0.2](x1){} node[free,pos=0.40](x2){} node[free,pos=0.6](x3){} node[free,pos=0.8](x4){}  (b)
\foreach \x in {1,2,...,4}{(x\x) -- ++(0,0.5) node[extra]{}}


(a)++(0,2)  node[insep](c){} 
(a)++(0,-2)  node[insep](d){} 
(a) to  node[free,pos=0.333](x4){} node[free,pos=0.666](x1){}    (c)
(a) to  node[free,pos=0.333](x3){} node[free,pos=0.666](x2){}    (d)
\foreach \x in {1,2,...,4}{(x\x) -- ++(-0.5,0) node[extra]{}}
;
\draw[line width=1pt]
(c) -- (x1)
(c) -- ++(150:0.7)
(c) -- ++(30:0.7)
(d) -- (x2)
(d) -- ++(210:0.7)
(d) -- ++(330:0.7)
;


\draw
(b)++(0,2)  node[insep](c){} 
(b)++(0,-2)  node[insep](d){} 
(b) to  node[free,pos=0.25](x5){} node[free,pos=0.50](x3){} node[free,pos=0.75](x1){}   (c)
(b) to  node[free,pos=0.25](x6){} node[free,pos=0.50](x4){} node[free,pos=0.75](x2){}   (d)
\foreach \x in {1,2,...,6}{(x\x) -- ++(0.5,0) node[extra]{}}
;
\draw[line width=1pt]
(c) -- (x1)
(c) -- ++(150:0.7)
(c) -- ++(30:0.7)
(d) -- (x2)
(d) -- ++(210:0.7)
(d) -- ++(330:0.7)
;

\draw(0,0) ++(0,-2) node{$H(2,2;4;3,3)$};
\end{tikzpicture}

%%%%%%%%%%%%%%%%%%% 

}
\caption{The configuration \label{fig:H}$H(t_1,t_2;r;s_1,s_2)$.}
\end{figure}

A configuration $\Phi(t,a_1,a_2,s)$ is formed by two 3-vertices $u$ and $v$
and 4 internally disjoint paths of lengths   $t+1$, $a_1+1$, $a_2+1$, and $s+1$, 
where the internal vertices of the paths are $2\bla$-vertices.
The path of length $t+1$ has $v$ as an endpoint, the paths of lengths $a_1+1$ and $a_2+1$ have $u$ and $v$ as endpoints
and the path of length $s+1$ has $u$ as an endpoint.
We call such configuration a \emph{$\Phi$-type configuration about $v$ and $u$}, see Figure~\ref{fig:Phi}.


\begin{figure}[hbtp]
\centering
{\usetikzlibrary[topaths]

\tikzset{
insep/.style={inner sep=2pt, outer sep=0pt, circle,fill}, 
free/.style={inner sep=2pt, outer sep=0pt, circle,fill=gray,draw}, 
extra/.style={inner sep=2pt, outer sep=0pt, circle,fill=white,draw}, 
}


\begin{tikzpicture}[scale=1]
\draw
(-2,0) node[insep,label=below:{$v$}](a){} 
(2,0) node[insep,label=below:{$u$}](b){}
(a)++(-3,0)  node[insep](c){} 
(b)++(3,0)  node[insep](d){} 
(a) to[bend left=50] node[free,pos=0.2](x1){} node[free,pos=0.40](x2){} node[free,pos=0.6](x3){} node[free,pos=0.8](x4){}  (b)
(a) to[bend right=50] node[free,pos=0.2](x5){} node[free,pos=0.4](x6){} node[free,pos=0.6](x7){}  node[free,pos=0.8](x8){}  (b)
(a) to  node[free,pos=0.25](x9){} node[free,pos=0.50](x10){} node[free,pos=0.75](x11){}   (c)
(b) to  node[free,pos=0.333](x12){} node[free,pos=0.666](x13){}    (d)
;
\draw[line width=1pt]
(c) -- (x11)
(c) -- ++(120:0.7)
(c) -- ++(240:0.7)
(d) -- (x13)
(d) -- ++(60:0.7)
(d) -- ++(-60:0.7)
;
\draw
\foreach \x in {1,2,...,13}
{
(x\x) -- ++(0,0.5) node[extra]{}
}
;
\draw(0,0) ++(0,-2) node{$\Phi(3,4,4,2)$};
\end{tikzpicture}

}
\caption{The configuration \label{fig:Phi}$\Phi(t,a_1,a_2,s)$.}
\end{figure}



The reducibility of these configurations was verified using computer\footnote{All source code and data is available at \url{http://www.math.iastate.edu/dstolee/r/scindex.htm} and \url{http://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i3p18/html}.}, and in addition the 8-caterpillar is addressed in Lemma~\ref{lma:caterpillar}.  
Given the definition of a $2\bla$-vertex, the vertices of degree two in these configurations may, or may not, be adjacent to some 1-vertices in $G$.  
We demonstrate the reducibility of the instances of these configurations wherein each vertex of degree 2 is adjacent to $d-2$ 1-vertices, as depicted in Figures \ref{fig:Y}--\ref{fig:Phi}.  
This suffices to address all other instances of these configurations that may occur.  

\begin{claim}\label{claim:red_cat}
The following caterpillars with maximum degree $d$ are reducible:
\begin{enumerate}
\item (Borodin and Ivanova~\cite{BI}) For $d = 3$, the $8$-caterpillar is 5-reducible.
\item (Wang and Zhao~\cite{WZ}) For $d \geq 4$, the  $(2d-2)$-caterpillar is $(2d-1)$-reducible.
\end{enumerate}
\end{claim}

These caterpillars are likely the smallest that are reducible for each degree $d$.
Thus, the bounds in Theorems~\ref{theorem:bi} and \ref{theorem:wz} are best possible using only Lemma~\ref{lma:nrs}.
To improve these bounds, we demonstrate larger reducible configurations and use a more complicated discharging argument.

\begin{claim}\label{clm:Reducible}
The following configurations with maximum degree 3 are 5-reducible:
\begin{enumerate}
\item $Y(1,6,7)$, $Y(2,5,6)$ and $Y(3,4,5)$.
\item $H(7,7;0;3,7),\, H(7,7;0;4,6),\, H(7,7;0;5,5),\, H(6,7;0;3,7),\, H(6,7;0;4,6),\\
        H(6,7;0;5,5),\, H(6,6;1;2,7),\, H(6,6;1;3,6),\, H(6,6;1;4,5),\, H(5,7;1;2,7),\\
        H(5,7;1;3,6),\, H(5,7;1;4,5),\, H(4,7;2;1,7),\, H(4,7;2;2,6),\, H(4,7;2;3,5),\\
        H(4,7;2;4,4),\, H(3,7;3;1,6),\, H(3,7;3;2,5) \text{ and }  H(3,7;3;3,4).$
\item   $\Phi(7,0,7,1),\, \Phi(7,0,6,1),\, \Phi(6,0,7,1),\, \Phi(6,1,6,1),\, \Phi(7,1,5,1), \Phi(5,1,7,1),\\
         \Phi(7,2,4,1),\, \Phi(4,2,7,1),\, \Phi(7,3,3,1),\, \Phi(3,3,7,1) \text{ and }\Phi(3,7,0,7).$
\end{enumerate}
\end{claim}

\begin{claim}\label{clm:Reducible4}
The following configurations with maximum degree 4 are $7$-reducible:
\[ Y(2,4,4),\ Y(1,5,5),\ Y(2,4,5),\ Y(3,4,4),\text{ and }Y(2,5,5).
\]
\end{claim}
    
 \subsection{Proof of Theorem~\ref{theorem:sparse}}

 \begin{proof}
Among graphs $G$ with $\mad(G) < 2 + \frac{1}{7}$ not containing $S_3$, $S_4$, or $S_7$, with $\sci > 5$, select $G$ while minimizing the number of vertices in $\ct(G)$.
Note that  $e(G) > 5$ since $\sci > 5$, and let $n$ be the number of vertices in $\ct(G)$. 
By using the discharging method, we will show that $\mad(\ct(G)) \geq 2+\frac{1}{7}$, which is a contradiction, so no such minimal counterexample exists.
        
Observe that $G$ does not contain any of the reducible configurations addressed in Claim \ref{clm:Reducible}.
We also have the following additional structure on $\ct(G)$.
      
\begin{lemma}\label{lma:cutedge2}
$\ct(G)$ is 2-connected.
\end{lemma}

\begin{proof}
Suppose that $\ct(G)$ contains a cut-edge $uv$.
In $G$, the vertices $u$ and $v$ have degree at least two.
There are exactly two components, $G_1$ and $G_2$, in $G - uv$, with $u \in V(G_1)$ and $v \in V(G_2)$.
Let $u_1,u_2$ be neighbors of $u$ in $G_1$ and $v_1,v_2$ be neighbors of $v$ in $G_2$; let $u_1 = u_2$ only when $u$ has a unique neighbor in $G_1$, and $v_1 = v_2$ only when $v$ has a unique neighbor in $G_2$.
Let $G_1' = G_1 + \{ uv, vv_1, vv_2\}$ and $G_2' = G_2 + \{ uv, uu_1, uu_2\}$.

If $G_1' = G$, then consider $G' = G - v_1 - v_2$.
Since $n(G') < n(G)$ and $\mad(G') \leq \mad(G)$, there is a strong 5-edge-coloring $c$ of $G'$.
Extend the coloring $c$ to color $c(vv_1)$ and $c(vv_2)$ from the colors not in $\{ c(uv), c(uu_1), c(uu_2)\}$, a contradiction.
We similarly reach a contradiction when $G_2' = G$.

Therefore, $n(G_i') < n(G)$ and $\mad(G_i') \leq \mad(G)$ for each $i \in \{1,2\}$.
Thus, there exist strong 5-edge-colorings $c_1$ and $c_2$ of $G_1'$ and $G_2'$, respectively.
For each coloring, the colors on the edges $uv, uu_1, uu_2, vv_1, vv_2$ are distinct.
Let $\pi$ be a permutation of the five colors satisfying $\pi(c_2(e)) = c_1(e)$ for each edge $e \in \{uv, uu_1, uu_2, vv_1, vv_2\}$.
Then, we extend the coloring $c_1$ of $G_1'$ to all of $G$ by assigning $c_1(e) = \pi(c_2(e))$ for all edges $e \in E(G_2')$.
The coloring $c_1$ is a strong 5-edge-coloring of $G$, a contradiction.
\end{proof}
       
        If $\ct(G)$ does not have any $3$-vertices, then $\ct(G)$ must be isomorphic to cycle $C_n$. 
        If $n \geq 9$, then $\ex_3(G)$ contains an 8-caterpillar.
        If $n \in \{5,6,8\}$, then $G$ is a subgraph of $S_5$, $S_6$, or $S_8$, which each has a strong edge-coloring using five colors, discovered by computer. 
        When $n \in\{3,4,7\}$, $G$ does not contain $S_3$, $S_4$, or $S_7$, and any proper subgraph of these graphs is $5$ strong edge-colorable, discovered by computer.
        Therefore, $\ct(G)$ is not isomorphic to a cycle, and hence for every $2\bla$-vertex $u$ in $G$, $|N_3(u)| \geq 1$.
        
        If $G$ has some vertex $v$ such that $|N_3(v)|=1$, then $G$ must be a subgraph of $\Theta(t_1,t_2,t_3)$, which is the graph consisting of three internally disjoint $x-y$ paths of length $t_1+1, t_2+1$ and $t_3+1$, for some $0 \leq t_1 \leq t_2 \leq t_3$.
 
        If $t_3 \geq 8$, then $\ex_3(G)$ contains an 8-caterpillar, so we assume that $t_3 < 8$. 
        Observe that if $\mad(\Theta(t_1,t_2,t_3)) < 2 + \frac{1}{7}$, then $t_1+t_2+t_3 \geq 13$.
        However, if $\Theta(t_1,t_2,t_3)$ does not contain a reducible $Y$-type configuration, then by Claim~\ref{clm:Reducible} the sequence $(t_1,t_2,t_3)$ is one of $(0,7,7)$, $(0,6,7)$, $(1,6,6)$, $(1,5,7)$, $(2,5,6)$, $(2,4,7)$, or $(3,3,7)$.
        In each of these cases, we have verified by computer that $\Theta(t_1,t_2,t_3)$ has a strong edge-coloring using five colors. The colorings are depicted in Figure~\ref{fig-extra}.
        
\begin{figure}
\begin{center}
\foreach \x in {1,2,3,4}{\includegraphics[scale=0.7,page=\x]{fig-thetas-colors}}\\[10pt]
\foreach \x in {5,6,7}{\includegraphics[scale=0.7,page=\x]{fig-thetas-colors} }
\caption{Strong edge-colorings of $\Theta(t_1,t_2,t_3)$. Style of line corresponds to color to make colors visible on a black and white print. }\label{fig-extra}
\end{center}
\end{figure}
        
        Therefore, $|N_3(v)|\geq 2$ for every $v\in\ct(G)$. 
        We proceed using discharging.
        Assign each vertex initial charge $d(v)$.
        Note that the total charge on the graph is $2e(\ct(G))$, which is at most $\mad(G)n < (2+\frac{1}{7})n$.
        We shall distribute charge among the vertices of $\ct(G)$ and result with charge at least $2 + \frac{1}{7}$ on every vertex, giving a contradiction.
        
        Distribute charge among the vertices according to the following discharging rules, applied to each pair of vertices $u, v \in V(\ct(G))$:
       \begin{enumerate}[(R1)]
            \item\label{2vtx} If $u$ is a 2-vertex and $v \in N_3(u)$, then $v$ sends  $\frac{1}{14}$ to $u$.
            \item\label{3vtx} If $v$ is a 3-vertex with $|\Resp(v)|\leq 10$ and $u \in N_3(v)$, then
                \begin{enumerate}[(a)]
                    \item\label{adj} if $d(u,v)=1$ and $|\Resp(u)| = 14$,  then $v$ sends  $\frac{1}{7}$ to $u$;
                    \item\label{near} otherwise, if $d(u,v) \leq 4$, then $v$ sends  $\frac{1}{14}$ to $u$.
                \end{enumerate}
        \end{enumerate}
        
        We will now verify the assertion that each vertex has final charge at least $2 + \frac{1}{7}$.
	If $v$ is a 2-vertex, then since $|N_3(v)| = 2$ the final charge on $v$ is $2 + \frac{1}{7}$ after by (R\ref{2vtx}).	 Let $v$ be a 3-vertex.	If $u \in N_3(v)$, then $d(u,v) \leq 8$ by Lemma~\ref{lma:caterpillar}.
        Claim~\ref{clm:Reducible} implies that $|\Resp(v)|\leq 14$. 
        
        \begin{mycases}
        
        \mycase{$|\Resp(v)| \in \{11, 12\}$.} In this case, $v$ only loses charge by (R\ref{2vtx}), so the final charge is at least $3 - \frac{12}{14} = 2 + \frac{1}{7}$.
        
        \mycase{$|\Resp(v)| = 14$.} By Claim~\ref{clm:Reducible}, the $Y$-type configuration about $v$ is $Y(0,7,7)$.
        Thus, some vertex $u_1 \in N_3(v)$ is at distance one from $v$.
        If $\mu(v,u_1) = 1$, then the $H$-type configuration about $v$ and $u_1$ is of the form $H(7,7;0;s_1,s_2)$; by Claim~\ref{clm:Reducible} $s_1+s_2 \leq 9$, $|\Resp(u_1)|\leq 9$, and  $u_1$ sends  $\frac{1}{7}$ to $v$ by (R\ref{adj}).
        If $\mu(v,u_1) = 2$, then the $\Phi$-type configuration about $v$ and $u_1$ is of the form $\Phi(7,0,7,s)$; by Claim~\ref{clm:Reducible} $s = 0$, $|\Resp(u_1)|\leq 7$, and  $u_1$ sends  $\frac{1}{7}$ to $v$ by (R\ref{adj}).

        
         \mycase{$|\Resp(v)| = 13$.} By Claim~\ref{clm:Reducible}, the $Y$-type configuration $Y(t_1,t_2,t_3)$ about $v$ is one of $Y(0,6,7)$,  $Y(1,6,6)$, $Y(1,5,7)$, $Y(2,4,7)$, or  $Y(3,3,7)$.
         We consider each case separately.
                  
         \begin{subcases}
         	\subcase{$(t_1,t_2,t_3) = (0,6,7).$} Let $u_1$ be the vertex in $N_3(v)$ at distance 1 from $v$.
        If $\mu(v,u_1) = 1$, then the $H$-type configuration about $v$ and $u_1$ is of the form $H(6,7;0;s_1,s_2)$; by Claim~\ref{clm:Reducible} $s_1+s_2 \leq 9$, $|\Resp(u_1)|\leq 9$, and $u_1$ sends $\frac{1}{14}$ to $v$ by (R\ref{near}).
        If $\mu(v,u_1) = 2$, then the $\Phi$-type configuration about $v$ and $u_1$ is of the form $\Phi(6,0,7,s)$ or $\Phi(7,0,6,s)$; by Claim~\ref{clm:Reducible} $s = 0$, $|\Resp(u_1)|\leq 7$, and  $u_1$ sends $\frac{1}{14}$ to $v$ by (R\ref{near}).
        
        \subcase{$(t_1,t_2,t_3) = (1,6,6).$} Let $u_1$ be the vertex in $N_3(v)$ at distance 2 from $v$.
        If $\mu(v,u_1) = 1$, then the $H$-type configuration about $v$ and $u_1$ is of the form $H(6,6;1;s_1,s_2)$; by Claim~\ref{clm:Reducible} $s_1+s_2 \leq 8$, $|\Resp(u_1)|\leq 9$, and  $u_1$ sends $\frac{1}{14}$ to $v$ by (R\ref{near}).
        If $\mu(v,u_1) = 2$, then the $\Phi$-type configuration about $v$ and $u_1$ is of the form $\Phi(6,1,7,s)$ or $\Phi(7,1,6,s)$; by Claim~\ref{clm:Reducible} $s = 0$, $|\Resp(u_1)|\leq 8$, and  $u_1$ sends $\frac{1}{14}$ to $v$ by (R\ref{near}).
        
        \subcase{$(t_1,t_2,t_3) = (1,5,7).$} Let $u_1$ be the vertex in $N_3(v)$ at distance 2 from $v$.
        If $\mu(v,u_1) = 1$, then the $H$-type configuration about $v$ and $u_1$ is of the form $H(5,7;1;s_1,s_2)$; by Claim~\ref{clm:Reducible} $s_1+s_2 \leq 8$, $|\Resp(u_1)|\leq 9$, and  $u_1$ sends $\frac{1}{14}$ to $v$ by (R\ref{near}).
        If $\mu(v,u_1) = 2$, then the $\Phi$-type configuration about $v$ and $u_1$ is of the form $\Phi(5,1,7,s)$ or $\Phi(7,1,5,s)$; by Claim~\ref{clm:Reducible} $s = 0$, $|\Resp(u_1)|\leq 8$, and  $u_1$ sends  $\frac{1}{14}$ to $v$ by (R\ref{near}).
        
        
        \subcase{$(t_1,t_2,t_3) = (2,4,7).$} Let $u_1$ be the vertex in $N_3(v)$ at distance 3 from $v$.
        If $\mu(v,u_1) = 1$, then the $H$-type configuration about $v$ and $u_1$ is of the form $H(4,7;2;s_1,s_2)$; by Claim~\ref{clm:Reducible} $s_1+s_2 \leq 7$, $|\Resp(u_1)|\leq 9$, and $u_1$ sends  $\frac{1}{14}$ to $v$ by (R\ref{near}).
        If $\mu(v,u_1) = 2$, then the $\Phi$-type configuration about $v$ and $u_1$ is of the form $\Phi(4,2,7,s)$ or $\Phi(7,2,4,s)$; by Claim~\ref{clm:Reducible} $s = 0$, $|\Resp(u_1)|\leq 8$, and  $u_1$ sends  $\frac{1}{14}$ to $v$ by (R\ref{near}).
        
        
        
        \subcase{$(t_1,t_2,t_3) = (3,3,7).$} Let $u_1$ be the vertex in $N_3(v)$ at distance 4 from $v$.
        If $\mu(v,u_1) = 1$, then the $H$-type configuration about $v$ and $u_1$ is of the form $H(3,7;3;s_1,s_2)$; by Claim~\ref{clm:Reducible} $s_1+s_2 \leq 7$, $|\Resp(u_1)|\leq 10$, and  $u_1$ sends  $\frac{1}{14}$ to $v$ by (R\ref{near}).
        If $\mu(v,u_1) = 2$, then the $\Phi$-type configuration about $v$ and $u_1$ is of the form $\Phi(3,3,7,s)$ or $\Phi(7,3,3,s)$; by Claim~\ref{clm:Reducible} $s = 0$, $|\Resp(u_1)|\leq 10$, and  $u_1$ sends  $\frac{1}{14}$ to $v$ by (R\ref{near}).
        
        \end{subcases}
        
        \mycase{$|\Resp(v)| \leq 10$.}
        In this case, $v$ loses charge at most $\frac{10}{14}$ by (R\ref{2vtx}), so if it sends  at most $\frac{1}{7}$ by (R\ref{3vtx}), then the final charge on $v$ is at least $2 + \frac{1}{7}$.
        Consider how much is sent by (R\ref{3vtx}).
        
        \begin{subcases}
        \subcase{$v$ sends  $\frac{3}{14}$ by (R\ref{3vtx}).}
        		If $|\Resp(v)| \leq 9$, then the final charge on $v$ is at least $2 + \frac{1}{7}$, so assume that $|\Resp(v)| = 10$.
        		If $v$ sends  $\frac{1}{14}$ to each of three vertices in $N_3(v)$, then $d(v,u) \leq 4$ for each $u \in N_3(v)$ and hence $|\Resp(v)| < 10$.		
		Thus, $v$ sends  $\frac{1}{7}$ to some $u_1 \in N_3(v)$ and $\frac{1}{14}$ to some $u_2 \in N_3(v)$.
		Since $|\Resp(u_1)| = 14$, Claim~\ref{clm:Reducible} implies that the $Y$-type configuration about $u_1$ is of the form $Y(0,7,7)$.
		Since $v$ is adjacent to $u_1$, $d(v,u_2)\leq 4$, and $|\Resp(v)| = 10$, the $Y$-type configuration about $v$ is of the form $Y(0,3,7)$.
		If $\mu(v,u_1)= 1$, then the $H$-type configuration about $v$ and $u_1$ is of the form $H(3,7;0;7;7)$ which is reducible by Claim~\ref{clm:Reducible}.
		If $\mu(v,u_1)= 2$, then the $\Phi$-type configuration about $v$ and $u_1$ is of the form $\Phi(3,7,0,7)$ which is reducible by Claim~\ref{clm:Reducible}.
		
	
        \subcase{$v$ sends  $\frac{2}{7}$ by (R\ref{3vtx}).}
		In this case, $v$ must send charge $\frac{1}{7}$ to at least one vertex $u_1$ in $N_3(v)$.	
		If $v$ sends  $\frac{1}{7}$ to another vertex $u_2$ in $N_3(v)$, then, as $G$ contains no $8$-caterpillar, $|\Resp(v)| \leq 7$ and hence the final charge on $v$ is at least $2 + \frac{3}{14}$.
		If $v$ sends  $\frac{1}{14}$ to the other two vertices $u_2$ and $u_3$ in $N_3(v)$, then $|\Resp(v)| \leq 6$ and hence the final charge on $v$ is at least $2 + \frac{5}{14}$.
		
	
	\subcase{$v$ either sends  $\frac{5}{14}$ or $\frac{3}{7}$ by (R\ref{3vtx}).}	
		Suppose that $v$ sends  $\frac{5}{14}$ by (R\ref{3vtx}). Thus, $v$ must send charge $\frac{1}{7}$ to two of three vertices in $N_3(v)$, and $\frac{1}{14}$ to the third vertex.  This implies that $|\Resp(v)|\le 3$ and hence the final charge on $v$ is at least $2 + \frac{3}{7}$.  Similarly, if $v$ sends  $\frac{3}{7}$ by (R\ref{3vtx}), then $|Resp(v)|=0$.  Thus, the final charge on $v$ is $2+\frac{4}{7}$.  
        \end{subcases}
        
         
        \end{mycases}
        
        In all cases, we verified that the final charge is at least $2 + \frac{1}{7}$, contradicting that the average degree of $\ct(G)$ is strictly less than $2 + \frac{1}{7}$.
    \end{proof}
    
We note that it is possible to improve the bound $\mad(G) < 2 + \frac{1}{7}$ by a small amount.
In particular, the discharging method used above essentially states that the average size of a responsibility set in $\ct(G)$ is at most 12.
By careful analysis, we can find that a 3-vertex $v$ with $|\Resp(v)|\leq 11$ has some excess charge after the discharging argument that could be used to increase the charge on nearby vertices by a small fraction.
We have verified using computation that for every 3-vertex $v$, there is at least one vertex $u \in N_3(v)$ where $|\Resp(u)| < 12$.
Thus, it is impossible to have a minimal counterexample where all responsibility sets have size 12, and it is feasible to construct a discharging argument that will improve on the bound $\mad(G) < 2 + \frac{1}{7}$ by a small fraction.
We do not do this explicitly as it requires significant detail without significant gain.

In order to prove that $\mad(G) < 2 + \frac{1}{6}$ implies that $G$ can be strongly 5-edge-colored, then the proof will imply that the average size of a responsibility set is at most 10.
This will require sending charge to all of the vertices with 11 or 12 vertices in the responsibility set, and also making sure that the charge comes from vertices with responsibility sets much smaller.
Likely, larger reducible configurations will grant some improvement in this direction, but our algoritheorem is insufficient to effectively test reducibility for larger configurations.\\

\subsection{Proof of Theorem~\ref{theorem:sparse4}}

\begin{proof}
Note that the second item of Theorem~\ref{theorem:sparse4} follows from the first by Proposition~\ref{prop:mad}.
For the first item, we follow a similar discharging argument as in Theorem~\ref{theorem:sparse}.
The argument will be simpler as we will only discharge from $3^+$-vertices to $2\bla$-vertices.
Select a graph $G$ that satisfies the hypotheses and minimizes $n(G)$.
Observe that $\ct(G)$ is 2-connected by an argument similar to Lemma~\ref{lma:cutedge2}.

Since the $6$-caterpillar is $7$-reducible by Claim \ref{claim:red_cat}, $\ct(G)$ does not contain a path of six $2\bla$-vertices.
Since $G$ has girth at least 7, $\ct(G)$ is not a cycle, so it contains at least one $3^+$-vertex.

%[What other ``base cases'' do we need to consider? Figure 8's? Thetas? 4-Thetas?]

If $v$ is a $3^+$-vertex, then let $\Resp(v)$ be the set of $2\bla$-vertices reachable from $v$ using only $2\bla$-vertices.
We consider $\Resp(v)$ to be a multiset, where the multiplicity of a vertex $u \in \Resp(v)$ is given by the number of paths from $v$ to $u$ using only $2\bla$-vertices. 
Note that the multiplicity is either 1 or 2.

Assign charge $d_{\ct(G)}(v)$ to each vertex $v \in V(\ct(G))$.
Note that the average charge on each vertex is equal to the average degree of $G$.
To discharge, let $\varepsilon = \frac{1}{13}$ and each $3^+$-vertex $v$ sends $\varepsilon m$ to each $2\bla$-vertex in $\Resp(v)$ with multiplicity $m$.
Thus, every $2\bla$-vertex ends with charge $2 + \frac{2}{13}$.


Suppose $d_{\ct(G)}(v) = 3$.
Since $\ct(G)$ is 2-connected, all vertices in $\Resp(v)$ appear with multiplicity one.
By Claim~\ref{clm:Reducible4}, $|\Resp(v)| \leq 11$. % (and if $|\Resp(v)| = 11$ the $Y$-type configuration about $v$ is $Y(2,4,5)$..
Thus each $3$-vertex ends with final charge  at least $3 - \frac{11}{13} = 2 + \frac{2}{13}$. 

Suppose $d_{\ct(G)}(v) = 4$.
Since the $(6,4)$-caterpillar is reducible, each path of $2\bla$-vertices has length at most five, and hence $|\Resp(v)| \leq 20$, including multiplicity. % (and if $|\Resp(v)| = 11$ the $Y$-type configuration about $v$ is $Y(2,4,5)$..
Thus each $4$-vertex ends with final charge  at least $4 - \frac{20}{13} = 2 + \frac{6}{13} > 2 + \frac{2}{13}$. 

Therefore, every vertex ends with final charge at least $2 + \frac{2}{13}$ and thus the average degree of $G$ is at least $2 + \frac{2}{13}$, a contradiction.
\end{proof}
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
\subsection*{Acknowledgements}

This collaboration began as part of the 2014 Rocky Mountain--Great Plains Graduate Research Workshop in Combinatorics. Please see  \url{http://combinatoricsworkshop.org/} for more information about the GRWC. The authors also thank the referees for their useful comments, which greatly improved the final product.  

%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% You do not have to use the same format for your references, but 
%    include everything in this file.  Don't use natbib please.
% If you use BibTeX to create a bibliography, copy the .bbl file into here.

\begin{thebibliography}{99}

\bibitem{Alon95}
N.~Alon.
\newblock Combinatorial {N}ullstellensatz.
\newblock {\em Combin. Probab. Comput.} \textbf{8} (1999), 7--29.

\bibitem{Andersen}
L. D. Andersen, The strong chromatic index of a cubic graph is at most 10, \textit{Discrete Math.} 108 (1992) 231--252.

\bibitem{BI} O.V. Borodin and A.O. Ivanova, Precise upper bound for the strong edge chromatic number of sparse planar graphs. \textit{Discussiones Mathematicae Graph Theory}, 33(4) (2014) 759--770.

\bibitem{magma} W. Bosma, J. Cannon, and C. Playoust, The Magma algebra system. I. The user language. \textit{J. Symbolic Comput.} \textbf{24} (1997) 235--265.

\bibitem{BJ} H. Bruhn, F. Joos, A stronger bound for the strong chromatic index. \textit{Electronic Notes in Discrete Mathematics} \textbf{49} (2015), 277--284.

\bibitem{CMPR} J. Chang, M. Montassier, A. P\v{e}che, and A. Raspaud, Strong chromatic index of planar graphs with large girth. \textit{Discussiones Mathematicae Graph Theory},  \textbf{34}, (2014) 723--733.

\bibitem{CW} D.W. Cranston and D.B. West, An introduction to the discharging method via graph coloring. \textit{Discrete Math.}, \textbf{340} (2017), 766--793.

\bibitem{EN1988}
P.~Erd\H{o}s,
Problems and results in combinatorial analysis and graph theory,
\textit{Proceedings of the First Japan Conference on Graph Theory and Applications} 
(Hakone, 1986), 
\textbf{72} (1988), 81--92.

\bibitem{Faudree90}
R.J. Faudree, A. Gy\'arfas, R.H. Schelp, and Zs. Tuza. 
\newblock The strong chromatic index of graphs, 
\newblock {\em Ars Combin.} \textbf{29} (1990) (B), 205--211.

\bibitem{Fouquet83}
J.-L. Fouquet and J.-L. Jolivet, 
\newblock Strong edge-colorings of graphs and applications to multi-k-gons, 
\newblock {\em Ars Combin.} \textbf{16} (1983) (A) 141--150.

\bibitem{Fouquet84}
J.-L. Fouquet and J.-L. Jolivet, 
\newblock Strong edge-coloring of cubic planar graphs, in Progress in graph theory (Waterloo, Ont., 1982), 
\newblock Academic Press, Toronto, ON, 1984, pp. 247--264.

\bibitem{Hocquard11}
H. Hocquard and P. Valicov, 
\newblock Strong edge colouring of subcubic graphs, 
\newblock {\em Discrete Appl. Math.} \textbf{159} (2011), 1650--1657.

\bibitem{Hocquard13}
H. Hocquard, M. Montassier, A. Raspaud, and P. Valicov,
\newblock On strong edge-colouring of subcubic graphs
\newblock {\em Discrete Appl. Mathematics} \textbf{161} (2013), 2467--2479.

\bibitem{Hudak}
D. Hud\'ak, B. Lu\v{z}ar, R. Sot\'ak, and R. \v{S}krekovski, Strong edge-coloring of planar graphs, 
\textit{Discrete Math.} \textbf{324} (2014), 41--49.

\bibitem{KLRSWY2014} A.V. Kostochka, X. Li, W. Ruksasakchai, M. Santana, T. Wang, and G. Yu, Strong chromatic index of subcubic planar multigraphs, \textit{European Journal of Combin.}, \textbf{51} (2016) 380--397.

\bibitem{LMSS} B. Lu\v{z}ar, M. Mockov\v{c}iakov\'a, R. Sot\'ak, and R. \v{S}krekovski,
Strong edge coloring of subcubic bipartite graphs, 
 \arxiv{1311.6668}.

\bibitem{Maydanskiy05} M. Maydanskiy, The incidence coloring conjecture for graphs of maximum degree 3, \textit{Discrete Math.} \textbf{292} (2005), 131--141.


\bibitem{MR} M. Molloy and B. Reed, A bound on the strong chromatic index of a graph, \textit{J. Combin. Theory, Ser. B} \textbf{69} (1997), 103--109.

\bibitem{NRS} J. Ne\v{s}et\v{r}il, A. Raspaud, and E. Sopena, Colorings and girth of oriented planar graphs, \textit{Discrete Math.} 165/166 (1997) 519--530.

\bibitem{StegerYu}
A. Steger and M.-L. Yu, On induced matchings, \textit{Discrete Math.} \textbf{120} (1993), 291--295.

\bibitem{vu} V. H. Vu, A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs, \textit{Comb. Probab. Comp.}, \textbf{11} (2002), 103--111.

\bibitem{WZ} T. Wang and X. Zhao, Odd graphs and its application on the strong edge coloring. \emph{Applied Mathematics and Computation}  (2018), 246--251.

\bibitem{west}
D.~B. West.
\newblock {\em Introduction to graph theory}.
\newblock Prentice Hall, Inc., Upper Saddle River, NJ, 1996.

\bibitem{WuLin}
J. Wu and W. Lin, The strong chromatic index of a class of graphs, \textit{Discrete Math.} \textbf{308} (2008), 6254--6261.


\end{thebibliography}

%\appendix
%\flushleft
%
%\section{Software: SCI\_magma.txt}
%
%\section{Software: SCI\_Sage\_code.sage}
%
%\section{Software: StrongEdgeColorings.sws}
%
%\section{Software: strong\_edge\_reducible.c}


\end{document}
