Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Yoshimi Egawa
@article{DBLP:journals/dm/AndoE23,
author = {Kiyoshi Ando and
Yoshimi Egawa},
title = {Properly 3-contractible edges in a minimally 3-connected graph},
journal = {Discret. Math.},
volume = {346},
number = {5},
pages = {113321},
year = {2023},
url = {https://doi.org/10.1016/j.disc.2023.113321},
doi = {10.1016/J.DISC.2023.113321},
timestamp = {Tue, 28 Mar 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/AndoE23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/EgawaN23,
author = {Yoshimi Egawa and
Shunsuke Nakamura},
title = {Contractible Edges and Longest Cycles in 3-Connected Graphs},
journal = {Graphs Comb.},
volume = {39},
number = {1},
pages = {14},
year = {2023},
url = {https://doi.org/10.1007/s00373-022-02609-5},
doi = {10.1007/S00373-022-02609-5},
timestamp = {Fri, 10 Feb 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/gc/EgawaN23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/ChibaEF23,
author = {Shuya Chiba and
Yoshimi Egawa and
Shinya Fujita},
title = {Minimum Number of Edges Guaranteeing the Existence of a K\({}_{\mbox{1,
t}}\)-Factor in a Graph},
journal = {Graphs Comb.},
volume = {39},
number = {2},
pages = {27},
year = {2023},
url = {https://doi.org/10.1007/s00373-023-02616-0},
doi = {10.1007/S00373-023-02616-0},
timestamp = {Tue, 07 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/gc/ChibaEF23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/EgawaF22,
author = {Yoshimi Egawa and
Michitaka Furuya},
title = {Forbidden triples generating a finite set of graphs with minimum degree
three},
journal = {Discret. Appl. Math.},
volume = {320},
pages = {282--295},
year = {2022},
url = {https://doi.org/10.1016/j.dam.2022.05.001},
doi = {10.1016/J.DAM.2022.05.001},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/EgawaF22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/EgawaFK22,
author = {Yoshimi Egawa and
Michitaka Furuya and
Mikio Kano},
title = {Factors of bi-regular bipartite graphs},
journal = {Discret. Appl. Math.},
volume = {322},
pages = {268--272},
year = {2022},
url = {https://doi.org/10.1016/j.dam.2022.08.016},
doi = {10.1016/J.DAM.2022.08.016},
timestamp = {Sun, 13 Nov 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/EgawaFK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/EgawaFM21,
author = {Yoshimi Egawa and
Michitaka Furuya and
Hajime Matsumura},
title = {Existence of a spanning tree having small diameter},
journal = {Discret. Math.},
volume = {344},
number = {11},
pages = {112548},
year = {2021},
url = {https://doi.org/10.1016/j.disc.2021.112548},
doi = {10.1016/J.DISC.2021.112548},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/EgawaFM21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/AndoE21,
author = {Kiyoshi Ando and
Yoshimi Egawa},
title = {Contractible Edges and Contractible Triangles in a 3-Connected Graph},
journal = {Graphs Comb.},
volume = {37},
number = {5},
pages = {1807--1821},
year = {2021},
url = {https://doi.org/10.1007/s00373-021-02354-1},
doi = {10.1007/S00373-021-02354-1},
timestamp = {Wed, 03 Nov 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/gc/AndoE21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/akcej/EgawaZ20,
author = {Yoshimi Egawa and
Zhixian Zhao},
title = {Tree in forbidden triples generating a finite set of graphs with high
connectivity},
journal = {{AKCE} Int. J. Graphs Comb.},
volume = {17},
number = {1},
pages = {443--446},
year = {2020},
url = {https://doi.org/10.1016/j.akcej.2019.03.021},
doi = {10.1016/J.AKCEJ.2019.03.021},
timestamp = {Fri, 11 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/akcej/EgawaZ20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/EgawaKY20,
author = {Yoshimi Egawa and
Mikio Kano and
Maho Yokota},
title = {Existence of all generalized fractional (g, f)-factors of graphs},
journal = {Discret. Appl. Math.},
volume = {283},
pages = {265--271},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2020.01.014},
doi = {10.1016/J.DAM.2020.01.014},
timestamp = {Thu, 16 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/EgawaKY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/akcej/EgawaKN18,
author = {Yoshimi Egawa and
Keiko Kotani and
Shunsuke Nakamura},
title = {Structure of edges in a 4-connected graph not contained in triangles
and the number of contractible edges},
journal = {{AKCE} Int. J. Graphs Comb.},
volume = {15},
number = {2},
pages = {202--210},
year = {2018},
url = {https://doi.org/10.1016/j.akcej.2017.09.002},
doi = {10.1016/J.AKCEJ.2017.09.002},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/akcej/EgawaKN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/EgawaF18,
author = {Yoshimi Egawa and
Michitaka Furuya},
title = {The Existence of a Path-Factor without Small Odd Paths},
journal = {Electron. J. Comb.},
volume = {25},
number = {1},
pages = {1},
year = {2018},
url = {https://doi.org/10.37236/5817},
doi = {10.37236/5817},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/EgawaF18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/EgawaEM18,
author = {Yoshimi Egawa and
Hikoe Enomoto and
Naoki Matsumoto},
title = {The graph grabbing game on Km, n-trees},
journal = {Discret. Math.},
volume = {341},
number = {6},
pages = {1555--1560},
year = {2018},
url = {https://doi.org/10.1016/j.disc.2018.02.023},
doi = {10.1016/J.DISC.2018.02.023},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/EgawaEM18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/EgawaF18,
author = {Yoshimi Egawa and
Michitaka Furuya},
title = {Sufficient conditions for the existence of pseudo 2-factors without
isolated vertices and small odd cycles},
journal = {Discret. Math.},
volume = {341},
number = {8},
pages = {2276--2284},
year = {2018},
url = {https://doi.org/10.1016/j.disc.2018.05.001},
doi = {10.1016/J.DISC.2018.05.001},
timestamp = {Sat, 22 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/EgawaF18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/NakamuraEK18,
author = {Shunsuke Nakamura and
Yoshimi Egawa and
Keiko Kotani},
title = {Edges incident with a vertex of degree greater than four and a lower
bound on the number of contractible edges in a 4-connected graph},
journal = {Electron. Notes Discret. Math.},
volume = {68},
pages = {23--28},
year = {2018},
url = {https://doi.org/10.1016/j.endm.2018.06.005},
doi = {10.1016/J.ENDM.2018.06.005},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/NakamuraEK18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/EgawaKN18,
author = {Yoshimi Egawa and
Keiko Kotani and
Shunsuke Nakamura},
title = {Lower Bound on the Number of Contractible Edges in a 4-Connected Graph
with Edges Not Contained in Triangles},
journal = {Graphs Comb.},
volume = {34},
number = {5},
pages = {965--987},
year = {2018},
url = {https://doi.org/10.1007/s00373-018-1924-6},
doi = {10.1007/S00373-018-1924-6},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/EgawaKN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/EgawaFO18,
author = {Yoshimi Egawa and
Michitaka Furuya and
Kenta Ozeki},
title = {Sufficient conditions for the existence of a path-factor which are
related to odd components},
journal = {J. Graph Theory},
volume = {89},
number = {3},
pages = {327--340},
year = {2018},
url = {https://doi.org/10.1002/jgt.22253},
doi = {10.1002/JGT.22253},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/EgawaFO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/EgawaKY16,
author = {Yoshimi Egawa and
Mikio Kano and
Zheng Yan},
title = {(1, f)-Factors of Graphs with Odd Property},
journal = {Graphs Comb.},
volume = {32},
number = {1},
pages = {103--110},
year = {2016},
url = {https://doi.org/10.1007/s00373-015-1558-x},
doi = {10.1007/S00373-015-1558-X},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/EgawaKY16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/EgawaF16,
author = {Yoshimi Egawa and
Michitaka Furuya},
title = {Perfect Matchings Avoiding Several Independent Edges in a Star-Free
Graph},
journal = {J. Graph Theory},
volume = {82},
number = {1},
pages = {33--44},
year = {2016},
url = {https://doi.org/10.1002/jgt.21883},
doi = {10.1002/JGT.21883},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/EgawaF16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/EgawaFFPS15,
author = {Yoshimi Egawa and
Jun Fujisawa and
Michitaka Furuya and
Michael D. Plummer and
Akira Saito},
title = {Forbidden Triples Generating a Finite set of 3-Connected Graphs},
journal = {Electron. J. Comb.},
volume = {22},
number = {3},
pages = {3},
year = {2015},
url = {https://doi.org/10.37236/3255},
doi = {10.37236/3255},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/EgawaFFPS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/EgawaFPSY15,
author = {Yoshimi Egawa and
Jun Fujisawa and
Michael D. Plummer and
Akira Saito and
Tomoki Yamashita},
title = {Perfect matchings avoiding prescribed edges in a star-free graph},
journal = {Discret. Math.},
volume = {338},
number = {12},
pages = {2260--2274},
year = {2015},
url = {https://doi.org/10.1016/j.disc.2015.05.014},
doi = {10.1016/J.DISC.2015.05.014},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/EgawaFPSY15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/EgawaO15,
author = {Yoshimi Egawa and
Kenta Ozeki},
title = {Spanning Trees with Vertices Having Large Degrees},
journal = {J. Graph Theory},
volume = {79},
number = {3},
pages = {213--221},
year = {2015},
url = {https://doi.org/10.1002/jgt.21824},
doi = {10.1002/JGT.21824},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/EgawaO15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/EgawaO14,
author = {Yoshimi Egawa and
Kenta Ozeki},
title = {A necessary and sufficient condition for the existence of a spanning
tree with specified vertices having large degrees},
journal = {Comb.},
volume = {34},
number = {1},
pages = {47--60},
year = {2014},
url = {https://doi.org/10.1007/s00493-014-2576-7},
doi = {10.1007/S00493-014-2576-7},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/EgawaO14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmgt/EgawaKY14,
author = {Yoshimi Egawa and
Mikio Kano and
Zheng Yan},
title = {Star-cycle factors of graphs},
journal = {Discuss. Math. Graph Theory},
volume = {34},
number = {1},
pages = {193--198},
year = {2014},
url = {https://doi.org/10.7151/dmgt.1717},
doi = {10.7151/DMGT.1717},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dmgt/EgawaKY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/EgawaF14,
author = {Yoshimi Egawa and
Michitaka Furuya},
title = {Forbidden Triples Containing a Complete Graph and a Complete Bipartite
Graph of Small Order},
journal = {Graphs Comb.},
volume = {30},
number = {5},
pages = {1149--1162},
year = {2014},
url = {https://doi.org/10.1007/s00373-013-1334-8},
doi = {10.1007/S00373-013-1334-8},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/EgawaF14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/AndoEK14,
author = {Kiyoshi Ando and
Yoshimi Egawa and
Matthias Kriesell},
title = {The Average Degree of Minimally Contraction-Critically 5-Connected
Graphs},
journal = {J. Graph Theory},
volume = {75},
number = {4},
pages = {331--354},
year = {2014},
url = {https://doi.org/10.1002/jgt.21741},
doi = {10.1002/JGT.21741},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AndoEK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/EgawaK13,
author = {Yoshimi Egawa and
Keiko Kotani},
title = {Existence of 4-factors in star-free graphs with high connectivity},
journal = {Australas. {J} Comb.},
volume = {55},
pages = {299--314},
year = {2013},
url = {http://ajc.maths.uq.edu.au/pdf/55/ajc\_v55\_p299.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/EgawaK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/EgawaFT13,
author = {Yoshimi Egawa and
Michitaka Furuya and
Masanori Takatou},
title = {Upper Bounds on the Paired Domination Subdivision Number of a Graph},
journal = {Graphs Comb.},
volume = {29},
number = {4},
pages = {843--856},
year = {2013},
url = {https://doi.org/10.1007/s00373-012-1162-2},
doi = {10.1007/S00373-012-1162-2},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/EgawaFT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ChenEGS12,
author = {Guantao Chen and
Yoshimi Egawa and
Ronald J. Gould and
Akira Saito},
title = {Forbidden pairs for 1-s2.0-S0012365X11004766-si1-connected Hamiltonian
graphs},
journal = {Discret. Math.},
volume = {312},
number = {5},
pages = {938--942},
year = {2012},
url = {https://doi.org/10.1016/j.disc.2011.10.019},
doi = {10.1016/J.DISC.2011.10.019},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ChenEGS12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorics/ChenEKMO11,
author = {Guantao Chen and
Yoshimi Egawa and
Ken{-}ichi Kawarabayashi and
Bojan Mohar and
Katsuhiro Ota},
title = {Toughness of \emph{K\({}_{\mbox{a,t}}\)}-Minor-Free Graphs},
journal = {Electron. J. Comb.},
volume = {18},
number = {1},
year = {2011},
url = {https://doi.org/10.37236/635},
doi = {10.37236/635},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorics/ChenEKMO11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/AldredEFOS11,
author = {Robert E. L. Aldred and
Yoshimi Egawa and
Jun Fujisawa and
Katsuhiro Ota and
Akira Saito},
title = {The existence of a 2-factor in \emph{K}\({}_{\mbox{1, \emph{n}}}\)-free
graphs with large connectivity and large edge-connectivity},
journal = {J. Graph Theory},
volume = {68},
number = {1},
pages = {77--89},
year = {2011},
url = {https://doi.org/10.1002/jgt.20541},
doi = {10.1002/JGT.20541},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AldredEFOS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/ChibaEY10,
author = {Shuya Chiba and
Yoshimi Egawa and
Kiyoshi Yoshimoto},
title = {A 2-factor in which each cycle contains a vertex in a specified stable
set},
journal = {Australas. {J} Comb.},
volume = {46},
pages = {203--210},
year = {2010},
url = {http://ajc.maths.uq.edu.au/pdf/46/ajc\_v46\_p203.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/ChibaEY10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CichaczEW09,
author = {Sylwia Cichacz and
Yoshimi Egawa and
Mariusz Wozniak},
title = {Arbitrary decompositions into open and closed trails},
journal = {Discret. Math.},
volume = {309},
number = {6},
pages = {1511--1516},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.03.004},
doi = {10.1016/J.DISC.2008.03.004},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CichaczEW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/EgawaOT09,
author = {Yoshimi Egawa and
Yumiko Okadome and
Masanori Takatou},
title = {5-Shredders in 5-connected graphs},
journal = {Discret. Math.},
volume = {309},
number = {6},
pages = {1565--1574},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2008.02.028},
doi = {10.1016/J.DISC.2008.02.028},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/EgawaOT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/EgawaK09,
author = {Yoshimi Egawa and
Keiko Kotani},
title = {4-factors in 2-connected star-free graphs},
journal = {Discret. Math.},
volume = {309},
number = {21},
pages = {6265--6270},
year = {2009},
url = {https://doi.org/10.1016/j.disc.2009.06.005},
doi = {10.1016/J.DISC.2009.06.005},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/EgawaK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/AndoEKK09,
author = {Kiyoshi Ando and
Yoshimi Egawa and
Ken{-}ichi Kawarabayashi and
Matthias Kriesell},
title = {On the number of 4-contractible edges in 4-connected graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {99},
number = {1},
pages = {97--109},
year = {2009},
url = {https://doi.org/10.1016/j.jctb.2008.04.003},
doi = {10.1016/J.JCTB.2008.04.003},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/AndoEKK09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AndoE08,
author = {Kiyoshi Ando and
Yoshimi Egawa},
title = {Edges not contained in triangles and the distribution of contractible
edges in a 4-connected graph},
journal = {Discret. Math.},
volume = {308},
number = {16},
pages = {3449--3460},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2007.07.013},
doi = {10.1016/J.DISC.2007.07.013},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AndoE08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AndoE08a,
author = {Kiyoshi Ando and
Yoshimi Egawa},
title = {Edges not contained in triangles and the number of contractible edges
in a 4-connected graph},
journal = {Discret. Math.},
volume = {308},
number = {23},
pages = {5463--5472},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2007.10.014},
doi = {10.1016/J.DISC.2007.10.014},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AndoE08a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/EgawaFO08,
author = {Yoshimi Egawa and
Shinya Fujita and
Katsuhiro Ota},
title = {K\({}_{\mbox{1, 3}}\)-factors in graphs},
journal = {Discret. Math.},
volume = {308},
number = {24},
pages = {5965--5973},
year = {2008},
url = {https://doi.org/10.1016/j.disc.2007.11.013},
doi = {10.1016/J.DISC.2007.11.013},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/EgawaFO08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/EgawaMYY08,
author = {Yoshimi Egawa and
Haruhide Matsuda and
Tomoki Yamashita and
Kiyoshi Yoshimoto},
title = {On a Spanning Tree with Specified Leaves},
journal = {Graphs Comb.},
volume = {24},
number = {1},
pages = {13--18},
year = {2008},
url = {https://doi.org/10.1007/s00373-007-0768-2},
doi = {10.1007/S00373-007-0768-2},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/EgawaMYY08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Egawa08,
author = {Yoshimi Egawa},
title = {\emph{k}-shredders in \emph{k}-connected graphs},
journal = {J. Graph Theory},
volume = {59},
number = {3},
pages = {239--259},
year = {2008},
url = {https://doi.org/10.1002/jgt.20336},
doi = {10.1002/JGT.20336},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Egawa08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/EgawaIK08,
author = {Yoshimi Egawa and
Katsumi Inoue and
Ken{-}ichi Kawarabayashi},
title = {Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected
Graphs},
journal = {{SIAM} J. Discret. Math.},
volume = {21},
number = {4},
pages = {1061--1070},
year = {2008},
url = {https://doi.org/10.1137/060665956},
doi = {10.1137/060665956},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/EgawaIK08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/EgawaEJOS07,
author = {Yoshimi Egawa and
Hikoe Enomoto and
Stanislav Jendrol' and
Katsuhiro Ota and
Ingo Schiermeyer},
title = {Independence number and vertex-disjoint cycles},
journal = {Discret. Math.},
volume = {307},
number = {11-12},
pages = {1493--1498},
year = {2007},
url = {https://doi.org/10.1016/j.disc.2005.11.086},
doi = {10.1016/J.DISC.2005.11.086},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/EgawaEJOS07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/AndoE07,
author = {Kiyoshi Ando and
Yoshimi Egawa},
title = {Contractible Edges in a 4-Connected Graph with Vertices of Degree
Greater Than Four},
journal = {Graphs Comb.},
volume = {23},
number = {Supplement-1},
pages = {99--115},
year = {2007},
url = {https://doi.org/10.1007/s00373-007-0699-y},
doi = {10.1007/S00373-007-0699-Y},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/AndoE07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ajc/EgawaT05,
author = {Yoshimi Egawa and
Masao Tsugaki},
title = {A bound on the order of a graph when both the graph and its complement
are contraction-critically k-connected},
journal = {Australas. {J} Comb.},
volume = {32},
pages = {105--110},
year = {2005},
url = {http://ajc.maths.uq.edu.au/pdf/32/ajc\_v32\_p105.pdf},
timestamp = {Wed, 11 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ajc/EgawaT05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/EgawaFKW05,
author = {Yoshimi Egawa and
Shinya Fujita and
Ken{-}ichi Kawarabayashi and
Hong Wang},
title = {Existence of two disjoint long cycles in graphs},
journal = {Discret. Math.},
volume = {305},
number = {1-3},
pages = {154--169},
year = {2005},
url = {https://doi.org/10.1016/j.disc.2005.10.017},
doi = {10.1016/J.DISC.2005.10.017},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/EgawaFKW05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AndoE03,
author = {Kiyoshi Ando and
Yoshimi Egawa},
title = {Maximum number of edges in a critically \emph{k}-connected graph},
journal = {Discret. Math.},
volume = {260},
number = {1-3},
pages = {1--25},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(02)00489-2},
doi = {10.1016/S0012-365X(02)00489-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AndoE03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/EgawaHKW03,
author = {Yoshimi Egawa and
Mariko Hagita and
Ken{-}ichi Kawarabayashi and
Hong Wang},
title = {Covering vertices of a graph by k disjoint cycles},
journal = {Discret. Math.},
volume = {270},
number = {1-3},
pages = {114--124},
year = {2003},
url = {https://doi.org/10.1016/S0012-365X(02)00831-2},
doi = {10.1016/S0012-365X(02)00831-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/EgawaHKW03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/EgawaEFLS03,
author = {Yoshimi Egawa and
Hikoe Enomoto and
Ralph J. Faudree and
Hao Li and
Ingo Schiermeyer},
title = {Two-factors each component of which contains a specified vertex},
journal = {J. Graph Theory},
volume = {43},
number = {3},
pages = {188--198},
year = {2003},
url = {https://doi.org/10.1002/jgt.10113},
doi = {10.1002/JGT.10113},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/EgawaEFLS03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/EgawaET02,
author = {Yoshimi Egawa and
Hikoe Enomoto and
Norihide Tokushige},
title = {Graph decompositions through prescribed vertices without isolates},
journal = {Ars Comb.},
volume = {62},
year = {2002},
timestamp = {Fri, 12 Dec 2003 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/EgawaET02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AndoEKKM02,
author = {Kiyoshi Ando and
Yoshimi Egawa and
Atsushi Kaneko and
Ken{-}ichi Kawarabayashi and
Haruhide Matsuda},
title = {Path factors in claw-free graphs},
journal = {Discret. Math.},
volume = {243},
number = {1-3},
pages = {195--200},
year = {2002},
url = {https://doi.org/10.1016/S0012-365X(01)00214-X},
doi = {10.1016/S0012-365X(01)00214-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AndoEKKM02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/EgawaIK02,
author = {Yoshimi Egawa and
Katsumi Inoue and
Ken{-}ichi Kawarabayashi},
title = {Nonseparating Induced Cycles Consisting of Contractible Edges in k-Connected
Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {11},
pages = {253--264},
year = {2002},
url = {https://doi.org/10.1016/S1571-0653(04)00069-1},
doi = {10.1016/S1571-0653(04)00069-1},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/EgawaIK02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/AkiyamaAE02,
author = {Jin Akiyama and
Kiyoshi Ando and
Yoshimi Egawa},
title = {Graphs {G} for which both {G} and G\({}^{\mbox{-}}\) are Contraction
Critically k-Connected},
journal = {Graphs Comb.},
volume = {18},
number = {4},
pages = {693--708},
year = {2002},
url = {https://doi.org/10.1007/s003730200054},
doi = {10.1007/S003730200054},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/AkiyamaAE02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/HuTWEH02,
author = {Zhiquan Hu and
Feng Tian and
Bing Wei and
Yoshimi Egawa and
Kazuhide Hirohata},
title = {Fan-type theorem for path-connectivity},
journal = {J. Graph Theory},
volume = {39},
number = {4},
pages = {265--282},
year = {2002},
url = {https://doi.org/10.1002/jgt.10028},
doi = {10.1002/JGT.10028},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/HuTWEH02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/EgawaO01,
author = {Yoshimi Egawa and
Katsuhiro Ota},
title = {Vertex-Disjoint Paths in Graphs},
journal = {Ars Comb.},
volume = {61},
year = {2001},
timestamp = {Fri, 12 Dec 2003 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/EgawaO01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/EgawaFGISW00,
author = {Yoshimi Egawa and
Ralph J. Faudree and
Ervin Gy{\"{o}}ri and
Yoshiyasu Ishigami and
Richard H. Schelp and
Hong Wang},
title = {Vertex-Disjoint Cycles Containing Specified Edges},
journal = {Graphs Comb.},
volume = {16},
number = {1},
pages = {81--92},
year = {2000},
url = {https://doi.org/10.1007/s003730050005},
doi = {10.1007/S003730050005},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/EgawaFGISW00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/EgawaI99,
author = {Yoshimi Egawa and
Katsumi Inoue},
title = {Radius of (2k-1)-Connected Graphs},
journal = {Ars Comb.},
volume = {51},
year = {1999},
timestamp = {Tue, 06 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/EgawaI99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/arscom/EgawaM99,
author = {Yoshimi Egawa and
Masahiko Miyamoto},
title = {Graph Labelings in Boolean Lattices},
journal = {Ars Comb.},
volume = {52},
year = {1999},
timestamp = {Tue, 06 Jan 2004 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/arscom/EgawaM99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/EgawaO99,
author = {Yoshimi Egawa and
Katsuhiro Ota},
title = {Vertex-disjoint claws in graphs},
journal = {Discret. Math.},
volume = {197-198},
pages = {225--246},
year = {1999},
url = {https://doi.org/10.1016/S0012-365X(99)90069-9},
doi = {10.1016/S0012-365X(99)90069-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/EgawaO99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Egawa98,
author = {Yoshimi Egawa},
title = {Contractible Cycles in Graphs with Girth at Least 5},
journal = {J. Comb. Theory, Ser. {B}},
volume = {74},
number = {2},
pages = {213--264},
year = {1998},
url = {https://doi.org/10.1006/jctb.1998.1844},
doi = {10.1006/JCTB.1998.1844},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Egawa98.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AndoE97,
author = {Kiyoshi Ando and
Yoshimi Egawa},
title = {The minimum number of edges in a vertex diameter-2-critical graph},
journal = {Discret. Math.},
volume = {167-168},
pages = {35--63},
year = {1997},
url = {https://doi.org/10.1016/S0012-365X(96)00215-4},
doi = {10.1016/S0012-365X(96)00215-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AndoE97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Egawa97,
author = {Yoshimi Egawa},
title = {Contractible cycles in graphs with large minimum degree},
journal = {Discret. Math.},
volume = {171},
number = {1-3},
pages = {103--119},
year = {1997},
url = {https://doi.org/10.1016/S0012-365X(96)00017-9},
doi = {10.1016/S0012-365X(96)00017-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Egawa97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/EgawaKK97,
author = {Yoshimi Egawa and
Mikio Kano and
Alexander K. Kelmans},
title = {Star partitions of graphs},
journal = {J. Graph Theory},
volume = {25},
number = {3},
pages = {185--190},
year = {1997},
url = {https://doi.org/10.1002/(SICI)1097-0118(199707)25:3\&\#60;185::AID-JGT2\&\#62;3.0.CO;2-H},
doi = {10.1002/(SICI)1097-0118(199707)25:3\&\#60;185::AID-JGT2\&\#62;3.0.CO;2-H},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/EgawaKK97.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/EgawaK96,
author = {Yoshimi Egawa and
Mikio Kano},
title = {Sufficient conditions for graphs to have (g, f)-factors},
journal = {Discret. Math.},
volume = {151},
number = {1-3},
pages = {87--90},
year = {1996},
url = {https://doi.org/10.1016/0012-365X(94)00085-W},
doi = {10.1016/0012-365X(94)00085-W},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/EgawaK96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Egawa96,
author = {Yoshimi Egawa},
title = {Vertex-Disjoint Cycles of the Same Length},
journal = {J. Comb. Theory, Ser. {B}},
volume = {66},
number = {2},
pages = {168--200},
year = {1996},
url = {https://doi.org/10.1006/jctb.1996.0015},
doi = {10.1006/JCTB.1996.0015},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Egawa96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/ChenELS96,
author = {Guantao Chen and
Yoshimi Egawa and
Xin Liu and
Akira Saito},
title = {Essential independent sets and Hamiltonian cycles},
journal = {J. Graph Theory},
volume = {21},
number = {2},
pages = {243--249},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199602)21:2\&\#60;242::AID-JGT15\&\#62;3.0.CO;2-L},
doi = {10.1002/(SICI)1097-0118(199602)21:2\&\#60;242::AID-JGT15\&\#62;3.0.CO;2-L},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/ChenELS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/EgawaOSY95,
author = {Yoshimi Egawa and
Katsuhiro Ota and
Akira Saito and
Xingxing Yu},
title = {Non-Contractible Edges in {A} 3-Connected Graph},
journal = {Comb.},
volume = {15},
number = {3},
pages = {357--364},
year = {1995},
url = {https://doi.org/10.1007/BF01299741},
doi = {10.1007/BF01299741},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/EgawaOSY95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/BollobasEHJ95,
author = {B{\'{e}}la Bollob{\'{a}}s and
Yoshimi Egawa and
Andrew J. Harris and
Guoping Jin},
title = {The maximal number of induced\emph{r}-partite subgraphs},
journal = {Graphs Comb.},
volume = {11},
number = {1},
pages = {1--19},
year = {1995},
url = {https://doi.org/10.1007/BF01787417},
doi = {10.1007/BF01787417},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/BollobasEHJ95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/EgawaV92,
author = {Yoshimi Egawa and
Preben D. Vestergaard},
title = {Spanning trees in a cactus},
journal = {Discret. Math.},
volume = {110},
number = {1-3},
pages = {269--274},
year = {1992},
url = {https://doi.org/10.1016/0012-365X(92)90717-T},
doi = {10.1016/0012-365X(92)90717-T},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/EgawaV92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/EgawaKM91,
author = {Yoshimi Egawa and
Atsushi Kaneko and
Makoto Matsumoto},
title = {A mixed version of Menger's theorem},
journal = {Comb.},
volume = {11},
number = {1},
pages = {71--74},
year = {1991},
url = {https://doi.org/10.1007/BF01375475},
doi = {10.1007/BF01375475},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/EgawaKM91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/EgawaS91,
author = {Yoshimi Egawa and
Akira Saito},
title = {Contractible edges in non-separating cycles},
journal = {Comb.},
volume = {11},
number = {4},
pages = {389--392},
year = {1991},
url = {https://doi.org/10.1007/BF01275673},
doi = {10.1007/BF01275673},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/EgawaS91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/Egawa91,
author = {Yoshimi Egawa},
title = {Contractible edges in\emph{n}-connected graphs with minimum degree
greater than or equal to [5\emph{n}/4]},
journal = {Graphs Comb.},
volume = {7},
number = {1},
pages = {15--21},
year = {1991},
url = {https://doi.org/10.1007/BF01789459},
doi = {10.1007/BF01789459},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/Egawa91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/EgawaGL91,
author = {Yoshimi Egawa and
R. Glas and
Stephen C. Locke},
title = {Cycles and paths through specified vertices in \emph{k}-connected
graphs},
journal = {J. Comb. Theory, Ser. {B}},
volume = {52},
number = {1},
pages = {20--29},
year = {1991},
url = {https://doi.org/10.1016/0095-8956(91)90086-Y},
doi = {10.1016/0095-8956(91)90086-Y},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/EgawaGL91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/EgawaO91,
author = {Yoshimi Egawa and
Katsuhiro Ota},
title = {Regular factors in \emph{K}\({}_{\mbox{1, \emph{n}}}\) free graphs},
journal = {J. Graph Theory},
volume = {15},
number = {3},
pages = {337--344},
year = {1991},
url = {https://doi.org/10.1002/jgt.3190150310},
doi = {10.1002/JGT.3190150310},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/EgawaO91.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/EgawaM89,
author = {Yoshimi Egawa and
Takashi Miyamoto},
title = {The longest cycles in a graph \emph{G} with minimum degree at least
{\(\vert\)}\emph{G}{\(\vert\)}/\emph{k}},
journal = {J. Comb. Theory, Ser. {B}},
volume = {46},
number = {3},
pages = {356--362},
year = {1989},
url = {https://doi.org/10.1016/0095-8956(89)90055-5},
doi = {10.1016/0095-8956(89)90055-5},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/EgawaM89.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/EgawaES88,
author = {Yoshimi Egawa and
Hikoe Enomoto and
Akira Saito},
title = {Factors and induced subgraphs},
journal = {Discret. Math.},
volume = {68},
number = {2-3},
pages = {179--189},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90111-2},
doi = {10.1016/0012-365X(88)90111-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/EgawaES88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AkiyamaEE88,
author = {Jin Akiyama and
Yoshimi Egawa and
Hikoe Enomoto},
title = {Preface},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {1--2},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90187-2},
doi = {10.1016/0012-365X(88)90187-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AkiyamaEE88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AndoEM87,
author = {Kiyoshi Ando and
Yoshimi Egawa and
Hirobumi Mizuno},
title = {Graphs {G} for which {G} and {\_}G are both semidecomposable},
journal = {Discret. Math.},
volume = {65},
number = {2},
pages = {109--114},
year = {1987},
url = {https://doi.org/10.1016/0012-365X(87)90134-8},
doi = {10.1016/0012-365X(87)90134-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AndoEM87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/EgawaMR87,
author = {Yoshimi Egawa and
Takashi Miyamoto and
Sergio Ruiz},
title = {On randomly\emph{n}-cyclic digraphs},
journal = {Graphs Comb.},
volume = {3},
number = {1},
pages = {227--238},
year = {1987},
url = {https://doi.org/10.1007/BF01788545},
doi = {10.1007/BF01788545},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/EgawaMR87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Egawa87,
author = {Yoshimi Egawa},
title = {Cycles in \emph{k}-connected graphs whose deletion results in a (\emph{k}-2)-connected
graph},
journal = {J. Comb. Theory, Ser. {B}},
volume = {42},
number = {3},
pages = {371--377},
year = {1987},
url = {https://doi.org/10.1016/0095-8956(87)90053-0},
doi = {10.1016/0095-8956(87)90053-0},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Egawa87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/EgawaES86,
author = {Yoshimi Egawa and
Hikoe Enomoto and
Akira Saito},
title = {Contracible edges in triangle-free graphs},
journal = {Comb.},
volume = {6},
number = {3},
pages = {269--274},
year = {1986},
url = {https://doi.org/10.1007/BF02579387},
doi = {10.1007/BF02579387},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/EgawaES86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/EgawaUFN86,
author = {Yoshimi Egawa and
Masatsugu Urabe and
Toshihito Fukuda and
Seiichiro Nagoya},
title = {A decomposition of complete bipartite graphs into edge-disjoint subgraphs
with star components},
journal = {Discret. Math.},
volume = {58},
number = {1},
pages = {93--95},
year = {1986},
url = {https://doi.org/10.1016/0012-365X(86)90190-1},
doi = {10.1016/0012-365X(86)90190-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/EgawaUFN86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Egawa86,
author = {Yoshimi Egawa},
title = {Characterization of the cartesian product of complete graphs by convex
subgraphs},
journal = {Discret. Math.},
volume = {58},
number = {3},
pages = {307--309},
year = {1986},
url = {https://doi.org/10.1016/0012-365X(86)90149-4},
doi = {10.1016/0012-365X(86)90149-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Egawa86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/gc/EgawaES86,
author = {Yoshimi Egawa and
Hikoe Enomoto and
Akira Saito},
title = {On component factors},
journal = {Graphs Comb.},
volume = {2},
number = {1},
pages = {223--225},
year = {1986},
url = {https://doi.org/10.1007/BF01788096},
doi = {10.1007/BF01788096},
timestamp = {Thu, 04 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/gc/EgawaES86.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Egawa85,
author = {Yoshimi Egawa},
title = {Association Schemes of Quadratic Forms},
journal = {J. Comb. Theory, Ser. {A}},
volume = {38},
number = {1},
pages = {1--14},
year = {1985},
url = {https://doi.org/10.1016/0097-3165(85)90016-0},
doi = {10.1016/0097-3165(85)90016-0},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Egawa85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/AlonE85,
author = {Noga Alon and
Yoshimi Egawa},
title = {Even edge colorings of a graph},
journal = {J. Comb. Theory, Ser. {B}},
volume = {38},
number = {1},
pages = {93--94},
year = {1985},
url = {https://doi.org/10.1016/0095-8956(85)90094-2},
doi = {10.1016/0095-8956(85)90094-2},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/AlonE85.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/Egawa81,
author = {Yoshimi Egawa},
title = {Characterization of H(n, q) by the Parameters},
journal = {J. Comb. Theory, Ser. {A}},
volume = {31},
number = {2},
pages = {108--125},
year = {1981},
url = {https://doi.org/10.1016/0097-3165(81)90007-8},
doi = {10.1016/0097-3165(81)90007-8},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/Egawa81.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-21 17:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
