<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05943496</id>
  <dt>j</dt>
  <an>05943496</an>
  <augroup>
    <au>Wang, Keke</au>
    <au>Hao, Rongxia</au>
    <au>Liu, Jianbing</au>
  </augroup>
  <ti>Group connectivity of 1-edge deletable IM-extendable graphs.</ti>
  <so>Int. J. Math. Comb. 1, 113-118 (2011).</so>
  <py>2011</py>
  <pu>The MADIS of Chinese Academy of Sciences, Beijing</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>graph</ut>
    <ut>multigroup connectivity</ut>
    <ut>group connectivity</ut>
    <ut>induced matching</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
  </ligroup>
  <abgroup>
    <ab>Summary: A graph $G$ is called a $k$-edges deletable IM-extendable graph, if $G-F$ is IM-extendable for every $F\subseteq E(G)$ with $|F|= k$. Denoted by $\Lambda_g(G)$ the group connectivity of a graph $G$. In this paper, $\Lambda_g(G)= 3$ is gotten if $G$ is a 4-regular claw-free 1-edge deletable IM-extendable graph.</ab>
    <rv></rv>
  </abgroup>
</item>