default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/dm/dm72.bht:"
download as .bib file
@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/AlaviBSR88,
author = {Yousef Alavi and
Fred Buckley and
Marc Shamula and
Sergio Ruiz},
title = {Highly irregular m-chromatic graphs},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {3--13},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90188-4},
doi = {10.1016/0012-365X(88)90188-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/AlaviBSR88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/AlonC88,
author = {Noga Alon and
Fan R. K. Chung},
title = {Explicit construction of linear sized tolerant networks},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {15--19},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90189-6},
doi = {10.1016/0012-365X(88)90189-6},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/AlonC88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Bollobas88,
author = {B{\'{e}}la Bollob{\'{a}}s},
title = {Sorting in rounds},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {21--28},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90190-2},
doi = {10.1016/0012-365X(88)90190-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Bollobas88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Chen88a,
author = {C. C. Chen},
title = {On edge-Hamiltonian property of Cayley graphs},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {29--33},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90191-4},
doi = {10.1016/0012-365X(88)90191-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Chen88a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/CockayneHL88,
author = {Ernest J. Cockayne and
Stephen T. Hedetniemi and
Renu C. Laskar},
title = {Gallai theorems for graphs, hypergraphs, and set systems},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {35--47},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90192-6},
doi = {10.1016/0012-365X(88)90192-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/CockayneHL88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Colbourn88a,
author = {Charles J. Colbourn},
title = {Edge-packing of graphs and network reliability},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {49--61},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90193-8},
doi = {10.1016/0012-365X(88)90193-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Colbourn88a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DejterCQ88,
author = {Italo J. Dejter and
J. Cordova and
J. A. Quintana},
title = {Two hamilton cycles in bipartite reflective kneser graphs},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {63--70},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90194-X},
doi = {10.1016/0012-365X(88)90194-X},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/DejterCQ88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DengL88,
author = {Chai{-}Ling Deng and
Chong{-}Keang Lim},
title = {A result on generalized latin rectangles},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {71--80},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90195-1},
doi = {10.1016/0012-365X(88)90195-1},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/DengL88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Erdos88,
author = {Paul Erd{\"{o}}s},
title = {Problems and results in combinatorial analysis and graph theory},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {81--92},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90196-3},
doi = {10.1016/0012-365X(88)90196-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Erdos88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ErdosFO88,
author = {Paul Erd{\"{o}}s and
Ralph J. Faudree and
Edward T. Ordman},
title = {Clique partitions and clique coverings},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {93--101},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90197-5},
doi = {10.1016/0012-365X(88)90197-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ErdosFO88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/ErdosFRS88,
author = {Paul Erd{\"{o}}s and
Ralph J. Faudree and
Cecil C. Rousseau and
Richard H. Schelp},
title = {Extremal theory and bipartite graph-tree Ramsey numbers},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {103--112},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90198-7},
doi = {10.1016/0012-365X(88)90198-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/ErdosFRS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Fajtlowicz88,
author = {Siemion Fajtlowicz},
title = {On conjectures of Graffiti},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {113--118},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90199-9},
doi = {10.1016/0012-365X(88)90199-9},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/Fajtlowicz88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FaudreeRS88,
author = {Ralph J. Faudree and
Cecil C. Rousseau and
Richard H. Schelp},
title = {Small order graph-tree Ramsey numbers},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {119--127},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90200-2},
doi = {10.1016/0012-365X(88)90200-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FaudreeRS88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/FouldsR88,
author = {Les R. Foulds and
Robert W. Robinson},
title = {Enumerating phylogenetic trees with multiple labels},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {129--139},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90201-4},
doi = {10.1016/0012-365X(88)90201-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/FouldsR88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Frank88,
author = {Ove Frank},
title = {Triad count statistics},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {141--149},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90202-6},
doi = {10.1016/0012-365X(88)90202-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Frank88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Fu-jiXR88,
author = {Fuji Zhang and
Xiaofeng Guo and
Rong{-}si Chen},
title = {Z-transformation graphs of perfect matchings of hexagonal systems},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {405--415},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90233-6},
doi = {10.1016/0012-365X(88)90233-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Fu-jiXR88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Gervacio88,
author = {Severino Villanueva Gervacio},
title = {Score sequences: Lexicographic enumeration and tournament construction},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {151--155},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90203-8},
doi = {10.1016/0012-365X(88)90203-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Gervacio88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Griggs88,
author = {Jerrold R. Griggs},
title = {Problems on chain partitions},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {157--162},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90204-X},
doi = {10.1016/0012-365X(88)90204-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Griggs88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HamidouneV88,
author = {Yahya Ould Hamidoune and
Michel Las Vergnas},
title = {A solution to the Mis{\`{e}}re Shannon switching Game},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {163--166},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90205-1},
doi = {10.1016/0012-365X(88)90205-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HamidouneV88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/HibiNTW88,
author = {Takayuki Hibi and
Hiroshi Narushima and
Morimasa Tsuchiya and
Kei{-}ichi Watanabe},
title = {A graph-theoretical characterization of the order complexes on the
2-sphere},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {167--174},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90206-3},
doi = {10.1016/0012-365X(88)90206-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/HibiNTW88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Hoede88,
author = {Cornelis Hoede},
title = {Hard graphs for the maximum clique problem},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {175--179},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90207-5},
doi = {10.1016/0012-365X(88)90207-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Hoede88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Ito88,
author = {Noboru Ito},
title = {Doubly regular asymmetric digraphs},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {181--185},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90208-7},
doi = {10.1016/0012-365X(88)90208-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Ito88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KajitaniUM88,
author = {Yoji Kajitani and
Shuichi Ueno and
Hiroshi Miyano},
title = {Ordering of the elements of a matroid such that its consecutive w
elements are independent},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {187--194},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90209-9},
doi = {10.1016/0012-365X(88)90209-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KajitaniUM88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KitagawaI88,
author = {Fumio Kitagawa and
Hideto Ikeda},
title = {An existential problem of a weight- controlled subset and its application
to school timetable construction},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {195--211},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90210-5},
doi = {10.1016/0012-365X(88)90210-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KitagawaI88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KocayL88,
author = {William L. Kocay and
Zeke Ming Lui},
title = {More non-reconstructible hypergraphs},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {213--224},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90211-7},
doi = {10.1016/0012-365X(88)90211-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KocayL88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/KohP88a,
author = {Khee Meng Koh and
K. S. Poh},
title = {Constructions of sensitive graphs which are not strongly sensitive},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {225--236},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90212-9},
doi = {10.1016/0012-365X(88)90212-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/KohP88a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LerouxV88,
author = {Pierre Leroux and
Xavier G{\'{e}}rard Viennot},
title = {Combinatorial resolution of systems of differential equations. {IV.}
separation of variables},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {237--250},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90213-0},
doi = {10.1016/0012-365X(88)90213-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LerouxV88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LoupekineW88,
author = {Feodor Loupekine and
John J. Watkins},
title = {Labeling angles of planar graphs},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {251--256},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90214-2},
doi = {10.1016/0012-365X(88)90214-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LoupekineW88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/LuczakP88,
author = {Tomasz Luczak and
Zbigniew Palka},
title = {Maximal induced trees in sparse random graphs},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {257--265},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90215-4},
doi = {10.1016/0012-365X(88)90215-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/LuczakP88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Mader88,
author = {Wolfgang Mader},
title = {Generalizations of critical connectivity of graphs},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {267--283},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90216-6},
doi = {10.1016/0012-365X(88)90216-6},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Mader88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Maehara88,
author = {Hiroshi Maehara},
title = {On the euclidean dimension of a complete multipartite graph},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {285--289},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90217-8},
doi = {10.1016/0012-365X(88)90217-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Maehara88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Miyamoto88,
author = {Izumi Miyamoto},
title = {Computation of some Cayley diagrams},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {291--293},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90218-X},
doi = {10.1016/0012-365X(88)90218-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Miyamoto88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Nishimura88,
author = {Tsuyoshi Nishimura},
title = {Short cycles in digraphs},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {295--298},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90219-1},
doi = {10.1016/0012-365X(88)90219-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Nishimura88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/NowickiW88,
author = {Krzysztof Nowicki and
John C. Wierman},
title = {Subgraph counts in random graphs using incomplete u-statistics methods},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {299--310},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90220-8},
doi = {10.1016/0012-365X(88)90220-8},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/NowickiW88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Plummer88,
author = {Michael D. Plummer},
title = {Toughness and matching extension in graphs},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {311--320},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90221-X},
doi = {10.1016/0012-365X(88)90221-X},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Plummer88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Reid88,
author = {K. B. Reid},
title = {Bipartite graphs obtained from adjacency matrices of orientations
of graphs},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {321--330},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90222-1},
doi = {10.1016/0012-365X(88)90222-1},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Reid88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Ruiz88,
author = {Mari{-}Jo P. Ruiz},
title = {C\({}_{\mbox{n}}\)-factors of group graphs},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {331--336},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90223-3},
doi = {10.1016/0012-365X(88)90223-3},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Ruiz88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Syslo88,
author = {Maciej M. Syslo},
title = {An algorithm for solving the jump number problem},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {337--346},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90224-5},
doi = {10.1016/0012-365X(88)90224-5},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Syslo88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/TehF88,
author = {Hoon heng Teh and
Meng Fang Foo},
title = {Large scale network analysis with applications to transportation,
communication and inference networks},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {347--353},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90225-7},
doi = {10.1016/0012-365X(88)90225-7},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/TehF88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/UenoKG88,
author = {Shuichi Ueno and
Yoji Kajitani and
Shin'ya Gotoh},
title = {On the nonseparating independent set problem and feedback set problem
for graphs with no vertex degree exceeding three},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {355--360},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90226-9},
doi = {10.1016/0012-365X(88)90226-9},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/UenoKG88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Ushio88,
author = {Kazuhiko Ushio},
title = {P\({}_{\mbox{3}}\)-Factorization of complete bipartite graphs},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {361--366},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90227-0},
doi = {10.1016/0012-365X(88)90227-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Ushio88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Vince88,
author = {Andrew Vince},
title = {n-Graphs},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {367--380},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90228-2},
doi = {10.1016/0012-365X(88)90228-2},
timestamp = {Thu, 23 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dm/Vince88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Wang88a,
author = {Jianfang Wang},
title = {On point-linear arboricity of planar graphs},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {381--384},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90229-4},
doi = {10.1016/0012-365X(88)90229-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Wang88a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Watanabe88,
author = {Toshihiro Watanabe},
title = {On the Littlewood-Richardson rule in terms of lattice path combinatorics},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {385--390},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90230-0},
doi = {10.1016/0012-365X(88)90230-0},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Watanabe88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Whitehead88,
author = {Earl Glen Whitehead Jr.},
title = {Chromatic polynomials of generalized trees},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {391--393},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90231-2},
doi = {10.1016/0012-365X(88)90231-2},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Whitehead88.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/Yap88,
author = {H. P. Yap},
title = {Packing of graphs - a survey},
journal = {Discret. Math.},
volume = {72},
number = {1-3},
pages = {395--404},
year = {1988},
url = {https://doi.org/10.1016/0012-365X(88)90232-4},
doi = {10.1016/0012-365X(88)90232-4},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/Yap88.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.
retrieved on 2025-01-20 16:42 CET from data curated 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:
