default search action
Search dblp for Publications
export results for "toc:db/journals/dm/dm251.bht:"
@article{DBLP:journals/dm/Berger02, author = {Amelie J. Berger}, title = {Minimal reducible bounds in the lattice of additive hereditary graph properties}, journal = {Discret. Math.}, volume = {251}, number = {1-3}, pages = {3--10}, year = {2002}, url = {https://doi.org/10.1016/S0012-365X(01)00322-3}, doi = {10.1016/S0012-365X(01)00322-3}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Berger02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BergerBMM02, author = {Amelie J. Berger and Izak Broere and Samuel J. T. Moagi and Peter Mih{\'{o}}k}, title = {Meet- and join-irreducibility of additive hereditary properties of graphs}, journal = {Discret. Math.}, volume = {251}, number = {1-3}, pages = {11--18}, year = {2002}, url = {https://doi.org/10.1016/S0012-365X(01)00323-5}, doi = {10.1016/S0012-365X(01)00323-5}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/BergerBMM02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BorowieckiS02, author = {Mieczyslaw Borowiecki and Elzbieta Sidorowicz}, title = {Some extremal problems of graphs with local constraints}, journal = {Discret. Math.}, volume = {251}, number = {1-3}, pages = {19--32}, year = {2002}, url = {https://doi.org/10.1016/S0012-365X(01)00324-7}, doi = {10.1016/S0012-365X(01)00324-7}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/BorowieckiS02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Brandt02, author = {Stephan Brandt}, title = {A 4-colour problem for dense triangle-free graphs}, journal = {Discret. Math.}, volume = {251}, number = {1-3}, pages = {33--46}, year = {2002}, url = {https://doi.org/10.1016/S0012-365X(01)00340-5}, doi = {10.1016/S0012-365X(01)00340-5}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Brandt02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Broersma02, author = {Hajo Broersma}, title = {On some intriguing problems in hamiltonian graph theory--a survey}, journal = {Discret. Math.}, volume = {251}, number = {1-3}, pages = {47--69}, year = {2002}, url = {https://doi.org/10.1016/S0012-365X(01)00325-9}, doi = {10.1016/S0012-365X(01)00325-9}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Broersma02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Brousek02, author = {Jan Brousek}, title = {Forbidden triples for hamiltonicity}, journal = {Discret. Math.}, volume = {251}, number = {1-3}, pages = {71--76}, year = {2002}, url = {https://doi.org/10.1016/S0012-365X(01)00326-0}, doi = {10.1016/S0012-365X(01)00326-0}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Brousek02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/BrousekFR02, author = {Jan Brousek and Ralph J. Faudree and Zdenek Ryj{\'{a}}cek}, title = {A note on hamiltonicity of generalized net-free graphs of large diameter}, journal = {Discret. Math.}, volume = {251}, number = {1-3}, pages = {77--85}, year = {2002}, url = {https://doi.org/10.1016/S0012-365X(01)00327-2}, doi = {10.1016/S0012-365X(01)00327-2}, timestamp = {Sun, 19 Jan 2025 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/BrousekFR02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/GorgolL02, author = {Izolda Gorgol and Tomasz Luczak}, title = {On induced Ramsey numbers}, journal = {Discret. Math.}, volume = {251}, number = {1-3}, pages = {87--96}, year = {2002}, url = {https://doi.org/10.1016/S0012-365X(01)00328-4}, doi = {10.1016/S0012-365X(01)00328-4}, timestamp = {Mon, 05 Feb 2024 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/GorgolL02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Goring02, author = {Frank G{\"{o}}ring}, title = {On 2-regular subgraphs in polyhedral graphs}, journal = {Discret. Math.}, volume = {251}, number = {1-3}, pages = {97--102}, year = {2002}, url = {https://doi.org/10.1016/S0012-365X(01)00329-6}, doi = {10.1016/S0012-365X(01)00329-6}, timestamp = {Sun, 02 Oct 2022 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/Goring02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Hexel02, author = {Erhard Hexel}, title = {On light graphs in the family of 4-connected planar graphs}, journal = {Discret. Math.}, volume = {251}, number = {1-3}, pages = {103--107}, year = {2002}, url = {https://doi.org/10.1016/S0012-365X(01)00330-2}, doi = {10.1016/S0012-365X(01)00330-2}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Hexel02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/HornakJ02, author = {Mirko Horn{\'{a}}k and Stanislav Jendrol'}, title = {Preface}, journal = {Discret. Math.}, volume = {251}, number = {1-3}, pages = {1}, year = {2002}, url = {https://doi.org/10.1016/S0012-365X(01)00320-X}, doi = {10.1016/S0012-365X(01)00320-X}, timestamp = {Tue, 07 May 2024 01:00:00 +0200}, biburl = {https://dblp.org/rec/journals/dm/HornakJ02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Klesc02, author = {Mari{\'{a}}n Klesc}, title = {The crossing number of \emph{K}\({}_{\mbox{2, 3}}\)x\emph{C}\({}_{\mbox{3}}\)}, journal = {Discret. Math.}, volume = {251}, number = {1-3}, pages = {109--117}, year = {2002}, url = {https://doi.org/10.1016/S0012-365X(01)00332-6}, doi = {10.1016/S0012-365X(01)00332-6}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Klesc02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/KouiderM02a, author = {Mekkia Kouider and Antoni Marczyk}, title = {On pancyclism in hamiltonian graphs}, journal = {Discret. Math.}, volume = {251}, number = {1-3}, pages = {119--127}, year = {2002}, url = {https://doi.org/10.1016/S0012-365X(01)00333-8}, doi = {10.1016/S0012-365X(01)00333-8}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/KouiderM02a.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Pruchnewski02, author = {Anja Pruchnewski}, title = {On the domination number of a graph}, journal = {Discret. Math.}, volume = {251}, number = {1-3}, pages = {129--136}, year = {2002}, url = {https://doi.org/10.1016/S0012-365X(01)00334-X}, doi = {10.1016/S0012-365X(01)00334-X}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Pruchnewski02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/RanderathST02, author = {Bert Randerath and Ingo Schiermeyer and Meike Tewes}, title = {Three-colourability and forbidden subgraphs. {II:} polynomial algorithms}, journal = {Discret. Math.}, volume = {251}, number = {1-3}, pages = {137--153}, year = {2002}, url = {https://doi.org/10.1016/S0012-365X(01)00335-1}, doi = {10.1016/S0012-365X(01)00335-1}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/RanderathST02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Recski02, author = {Andr{\'{a}}s Recski}, title = {Two matroidal families on the edge set of a graph}, journal = {Discret. Math.}, volume = {251}, number = {1-3}, pages = {155--162}, year = {2002}, url = {https://doi.org/10.1016/S0012-365X(01)00336-3}, doi = {10.1016/S0012-365X(01)00336-3}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Recski02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Skupien02, author = {Zdzislaw Skupien}, title = {Hamiltonicity of planar cubic multigraphs}, journal = {Discret. Math.}, volume = {251}, number = {1-3}, pages = {163--168}, year = {2002}, url = {https://doi.org/10.1016/S0012-365X(01)00337-5}, doi = {10.1016/S0012-365X(01)00337-5}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Skupien02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/TuzaV02, author = {Zsolt Tuza and Margit Voigt}, title = {A note on planar 5-list colouring: non-extendability at distance 4}, journal = {Discret. Math.}, volume = {251}, number = {1-3}, pages = {169--172}, year = {2002}, url = {https://doi.org/10.1016/S0012-365X(01)00338-7}, doi = {10.1016/S0012-365X(01)00338-7}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/TuzaV02.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
@article{DBLP:journals/dm/Wozniak02, author = {Mariusz Wozniak}, title = {On cyclically embeddable (\emph{n, n}-1)-graphs}, journal = {Discret. Math.}, volume = {251}, number = {1-3}, pages = {173--179}, year = {2002}, url = {https://doi.org/10.1016/S0012-365X(01)00339-9}, doi = {10.1016/S0012-365X(01)00339-9}, timestamp = {Fri, 12 Feb 2021 00:00:00 +0100}, biburl = {https://dblp.org/rec/journals/dm/Wozniak02.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.