<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05697846</id>
  <dt>j</dt>
  <an>05697846</an>
  <augroup>
    <au>Wang, Ruixia</au>
    <au>Yang, Aimin</au>
    <au>Wang, Shiying</au>
  </augroup>
  <ti>Kings in locally semicomplete digraphs.</ti>
  <so>J. Graph Theory 63, No. 4, 279-287 (2010).</so>
  <py>2010</py>
  <pu>John Wiley \& Sons, New York, NY</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>locally semicomplete digraphs</ut>
    <ut>2-kings</ut>
    <ut>round decomposable digraphs</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1002/jgt.20426</li>
  </ligroup>
  <abgroup>
    <ab>Summary: A $k$-king in a digraph $D$ is a vertex which can reach every other vertex by a directed path of length at most $k$. We consider $k$-kings in locally semicomplete digraphs and mainly prove that all strong locally semicomplete digraphs which are not round decomposable contain a 2-king.</ab>
    <rv></rv>
  </abgroup>
</item>