Search dblp for Publications

export results for "toc:db/journals/dm/dm276.bht:"

 download as .bib file

@article{DBLP:journals/dm/Bang-JensenJ04,
  author       = {J{\o}rgen Bang{-}Jensen and
                  Tibor Jord{\'{a}}n},
  title        = {Splitting off edges between two subsets preserving the edge-connectivity
                  of the graph},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {5--28},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00291-7},
  doi          = {10.1016/S0012-365X(03)00291-7},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Bang-JensenJ04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Bielak04,
  author       = {Halina Bielak},
  title        = {Local Ramsey numbers for copies of cycles},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {29--42},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00309-1},
  doi          = {10.1016/S0012-365X(03)00309-1},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Bielak04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/BonichonSM04,
  author       = {Nicolas Bonichon and
                  Bertrand Le Sa{\"{e}}c and
                  Mohamed Mosbah},
  title        = {Orthogonal drawings based on the stratification of planar graphs},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {43--57},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00305-4},
  doi          = {10.1016/S0012-365X(03)00305-4},
  timestamp    = {Tue, 11 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/BonichonSM04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/BorosGM04,
  author       = {Endre Boros and
                  Vladimir Gurvich and
                  Roy Meshulam},
  title        = {Difference graphs},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {59--64},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00321-2},
  doi          = {10.1016/S0012-365X(03)00321-2},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/BorosGM04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/CadaFLR04,
  author       = {Roman Cada and
                  Evelyne Flandrin and
                  Hao Li and
                  Zdenek Ryj{\'{a}}cek},
  title        = {Cycles through given vertices and closures},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {65--80},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00304-2},
  doi          = {10.1016/S0012-365X(03)00304-2},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/CadaFLR04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/CaporossiH04,
  author       = {Gilles Caporossi and
                  Pierre Hansen},
  title        = {Variable neighborhood search for extremal graphs. 5. Three ways to
                  automate finding conjectures},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {81--94},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00311-X},
  doi          = {10.1016/S0012-365X(03)00311-X},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/CaporossiH04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/CharonHHL04,
  author       = {Ir{\`{e}}ne Charon and
                  Iiro S. Honkala and
                  Olivier Hudry and
                  Antoine Lobstein},
  title        = {The minimum density of an identifying code in the king lattice},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {95--109},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00306-6},
  doi          = {10.1016/S0012-365X(03)00306-6},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/CharonHHL04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/CockayneFM04,
  author       = {Ernest J. Cockayne and
                  Odile Favaron and
                  Christina M. Mynhardt},
  title        = {On i\({}^{\mbox{-}}\)-ER-critical graphs},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {111--125},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00302-9},
  doi          = {10.1016/S0012-365X(03)00302-9},
  timestamp    = {Thu, 14 Oct 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/CockayneFM04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Courcelle04,
  author       = {Bruno Courcelle},
  title        = {Clique-width of countable graphs: a compactness property},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {127--148},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00303-0},
  doi          = {10.1016/S0012-365X(03)00303-0},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Courcelle04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/DeVosNR04,
  author       = {Matt DeVos and
                  Jaroslav Nesetril and
                  Andr{\'{e}} Raspaud},
  title        = {Antisymmetric flows and edge-connectivity},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {161--167},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00301-7},
  doi          = {10.1016/S0012-365X(03)00301-7},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/DeVosNR04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Delorme04,
  author       = {Charles Delorme},
  title        = {Laplacian eigenvalues and fixed size multisection},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {149--159},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00307-8},
  doi          = {10.1016/S0012-365X(03)00307-8},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Delorme04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Dobrynin04,
  author       = {Vladimir Dobrynin},
  title        = {On the rank of a matrix associated with a graph},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {169--175},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00308-X},
  doi          = {10.1016/S0012-365X(03)00308-X},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Dobrynin04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/EnomotoL04,
  author       = {Hikoe Enomoto and
                  Hao Li},
  title        = {Partition of a graph into cycles and degenerated cycles},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {177--181},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00300-5},
  doi          = {10.1016/S0012-365X(03)00300-5},
  timestamp    = {Tue, 21 Dec 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/EnomotoL04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Euler04,
  author       = {Reinhardt Euler},
  title        = {Coloring planar Toeplitz graphs and the stable set polytope},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {183--200},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00315-7},
  doi          = {10.1016/S0012-365X(03)00315-7},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Euler04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/FinbowH04,
  author       = {Art S. Finbow and
                  Bert L. Hartnell},
  title        = {Well-located graphs: a collection of well-covered ones},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {201--209},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00297-8},
  doi          = {10.1016/S0012-365X(03)00297-8},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/FinbowH04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/FouquetR04,
  author       = {Jean{-}Luc Fouquet and
                  Irena Rusu},
  title        = {Preface},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {1--2},
  year         = {2004},
  url          = {https://doi.org/10.1016/j.disc.2003.10.011},
  doi          = {10.1016/J.DISC.2003.10.011},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/FouquetR04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/GravierM04,
  author       = {Sylvain Gravier and
                  Fr{\'{e}}d{\'{e}}ric Maffray},
  title        = {On the choice number of claw-free perfect graphs},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {211--218},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00292-9},
  doi          = {10.1016/S0012-365X(03)00292-9},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/GravierM04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Gropp04,
  author       = {Harald Gropp},
  title        = {"R{\'{e}}seaux r{\'{e}}guliers" or regular graphs--Georges
                  Brunel as a French pioneer in graph theory},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {219--227},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00320-0},
  doi          = {10.1016/S0012-365X(03)00320-0},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Gropp04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/GuenocheLM04,
  author       = {Alain Gu{\'{e}}noche and
                  Bruno Leclerc and
                  Vladimir Makarenkov},
  title        = {On the extension of a partial metric to a tree metric},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {229--248},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00294-2},
  doi          = {10.1016/S0012-365X(03)00294-2},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/GuenocheLM04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/GuenverR04,
  author       = {Glen{-}Brug Guenver and
                  Jean{-}Xavier Rampon},
  title        = {Split orders},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {249--267},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00313-3},
  doi          = {10.1016/S0012-365X(03)00313-3},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/GuenverR04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/KabanovV04,
  author       = {Vladislav V. Kabanov and
                  Igor Vakula},
  title        = {The lower domination parameters in inflation of graphs of radius 1},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {269--272},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00310-8},
  doi          = {10.1016/S0012-365X(03)00310-8},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/KabanovV04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/MaxovaN04,
  author       = {Jana Maxov{\'{a}} and
                  Jaroslav Nesetril},
  title        = {On covers of graphs},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {287--294},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00314-5},
  doi          = {10.1016/S0012-365X(03)00314-5},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/MaxovaN04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Pecher04,
  author       = {Arnaud P{\^{e}}cher},
  title        = {Cayley partitionable graphs and near-factorizations of finite groups},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {295--311},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00293-0},
  doi          = {10.1016/S0012-365X(03)00293-0},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/dm/Pecher04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Randerath04,
  author       = {Bert Randerath},
  title        = {3-Colorability and forbidden subgraphs. {I:} Characterizing pairs},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {313--325},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00312-1},
  doi          = {10.1016/S0012-365X(03)00312-1},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Randerath04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Serra04,
  author       = {S{\`{o}}nia P. Mansilla and
                  Oriol Serra},
  title        = {Automorphism groups of k-arc transitive covers},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {273--285},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00298-X},
  doi          = {10.1016/S0012-365X(03)00298-X},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Serra04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Spinrad04,
  author       = {Jeremy P. Spinrad},
  title        = {A note on computing graph closures},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {327--329},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00316-9},
  doi          = {10.1016/S0012-365X(03)00316-9},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Spinrad04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Szekely04,
  author       = {L{\'{a}}szl{\'{o}} A. Sz{\'{e}}kely},
  title        = {A successful concept for measuring non-planarity of graphs: the crossing
                  number},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {331--352},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00317-0},
  doi          = {10.1016/S0012-365X(03)00317-0},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Szekely04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Szigeti04,
  author       = {Zolt{\'{a}}n Szigeti},
  title        = {On a min-max theorem on bipartite graphs},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {353--361},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00318-2},
  doi          = {10.1016/S0012-365X(03)00318-2},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Szigeti04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Vanherpe04,
  author       = {Jean{-}Marie Vanherpe},
  title        = {Clique-width of partner-limited graphs},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {363--374},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00295-4},
  doi          = {10.1016/S0012-365X(03)00295-4},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Vanherpe04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Wojda04,
  author       = {A. Pawel Wojda},
  title        = {A condition for a graph to contain \emph{k}-matching},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {375--378},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00299-1},
  doi          = {10.1016/S0012-365X(03)00299-1},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Wojda04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/Wozniak04,
  author       = {Mariusz Wozniak},
  title        = {Packing of graphs and permutations--a survey},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {379--391},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00296-6},
  doi          = {10.1016/S0012-365X(03)00296-6},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/Wozniak04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/X04a,
  title        = {Guest Editors},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {3},
  year         = {2004},
  timestamp    = {Sat, 22 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/X04a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dm/ZhangZY04,
  author       = {Heping Zhang and
                  Fuji Zhang and
                  Haiyuan Yao},
  title        = {\emph{Z}-transformation graphs of perfect matchings of plane bipartite
                  graphs},
  journal      = {Discret. Math.},
  volume       = {276},
  number       = {1-3},
  pages        = {393--404},
  year         = {2004},
  url          = {https://doi.org/10.1016/S0012-365X(03)00319-4},
  doi          = {10.1016/S0012-365X(03)00319-4},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dm/ZhangZY04.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.