default search action
Search dblp for Publications
export results for "toc:db/journals/dm/dm325.bht:"
@article{DBLP:journals/dm/BelcastroH14, author = {Sarah{-}Marie Belcastro and Ruth Haas}, title = {Counting edge-Kempe-equivalence classes for 3-edge-colored cubic graphs}, journal = {Discret. Math.}, volume = {325}, pages = {77--84}, year = {2014}, url = {https://doi.org/10.1016/j.disc.2014.02.014}, doi = {10.1016/J.DISC.2014.02.014}, timestamp = {Thu, 14 Oct 2021 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/BelcastroH14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BonamyB14, author = {Marthe Bonamy and Nicolas Bousquet}, title = {Brooks' theorem on powers of graphs}, journal = {Discret. Math.}, volume = {325}, pages = {12--16}, year = {2014}, url = {https://doi.org/10.1016/j.disc.2014.01.024}, doi = {10.1016/J.DISC.2014.01.024}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/BonamyB14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Chen14, author = {Shi{-}Chao Chen}, title = {On the number of overpartitions into odd parts}, journal = {Discret. Math.}, volume = {325}, pages = {32--37}, year = {2014}, url = {https://doi.org/10.1016/j.disc.2014.02.015}, doi = {10.1016/J.DISC.2014.02.015}, timestamp = {Mon, 28 Aug 2023 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/Chen14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/DasM14, author = {Kinkar Chandra Das and Seyed Ahmad Mojallal}, title = {On Laplacian energy of graphs}, journal = {Discret. Math.}, volume = {325}, pages = {52--64}, year = {2014}, url = {https://doi.org/10.1016/j.disc.2014.02.017}, doi = {10.1016/J.DISC.2014.02.017}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/DasM14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/DrapalGK14, author = {Ales Dr{\'{a}}pal and Terry S. Griggs and Andrew R. Kozlik}, title = {Triple systems and binary operations}, journal = {Discret. Math.}, volume = {325}, pages = {1--11}, year = {2014}, url = {https://doi.org/10.1016/j.disc.2014.02.007}, doi = {10.1016/J.DISC.2014.02.007}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/DrapalGK14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/El-ZanatiPT14, author = {Saad I. El{-}Zanati and Michael Plantholt and Shailesh K. Tipnis}, title = {On decomposing even regular multigraphs into small isomorphic trees}, journal = {Discret. Math.}, volume = {325}, pages = {47--51}, year = {2014}, url = {https://doi.org/10.1016/j.disc.2014.02.011}, doi = {10.1016/J.DISC.2014.02.011}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/El-ZanatiPT14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/HoholdtJ14, author = {Tom H{\o}holdt and J{\o}rn Justesen}, title = {On the sizes of expander graphs and minimum distances of graph codes}, journal = {Discret. Math.}, volume = {325}, pages = {38--46}, year = {2014}, url = {https://doi.org/10.1016/j.disc.2014.02.005}, doi = {10.1016/J.DISC.2014.02.005}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/HoholdtJ14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/ParkI14, author = {Jung{-}Heum Park and Insung Ihm}, title = {Disjoint path covers in cubes of connected graphs}, journal = {Discret. Math.}, volume = {325}, pages = {65--73}, year = {2014}, url = {https://doi.org/10.1016/j.disc.2014.02.010}, doi = {10.1016/J.DISC.2014.02.010}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/ParkI14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Petecki14, author = {Pawel Petecki}, title = {On cyclic Hamiltonian decompositions of complete k-uniform hypergraphs}, journal = {Discret. Math.}, volume = {325}, pages = {74--76}, year = {2014}, url = {https://doi.org/10.1016/j.disc.2014.02.020}, doi = {10.1016/J.DISC.2014.02.020}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Petecki14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/PlummerS14, author = {Michael D. Plummer and Akira Saito}, title = {A note on graphs contraction-critical with respect to independence number}, journal = {Discret. Math.}, volume = {325}, pages = {85--91}, year = {2014}, url = {https://doi.org/10.1016/j.disc.2014.02.004}, doi = {10.1016/J.DISC.2014.02.004}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/PlummerS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/StinsonST14, author = {Douglas R. Stinson and Colleen Swanson and Tran van Trung}, title = {A new look at an old construction: Constructing (simple) 3-designs from resolvable 2-designs}, journal = {Discret. Math.}, volume = {325}, pages = {23--31}, year = {2014}, url = {https://doi.org/10.1016/j.disc.2014.02.009}, doi = {10.1016/J.DISC.2014.02.009}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/StinsonST14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/ZhaoMPS14, author = {Yancai Zhao and Lianying Miao and Shiyou Pang and Wenyao Song}, title = {Acyclic vertex coloring of graphs of maximum degree six}, journal = {Discret. Math.}, volume = {325}, pages = {17--22}, year = {2014}, url = {https://doi.org/10.1016/j.disc.2014.01.022}, doi = {10.1016/J.DISC.2014.01.022}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/ZhaoMPS14.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
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.