Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/jgt/jgt22.bht:"
download as .bib file
@article{DBLP:journals/jgt/AdamsB96,
author = {Peter Adams and
Darryn E. Bryant},
title = {The spectrum problem for the Petersen graph},
journal = {J. Graph Theory},
volume = {22},
number = {2},
pages = {175--180},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199606)22:2\<175::AID-JGT8\>3.0.CO;2-K},
doi = {10.1002/(SICI)1097-0118(199606)22:2\<175::AID-JGT8\>3.0.CO;2-K},
timestamp = {Mon, 18 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/AdamsB96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Ainouche96,
author = {Ahmed Ainouche},
title = {A short proof of a theorem on Hamiltonian graphs},
journal = {J. Graph Theory},
volume = {22},
number = {1},
pages = {83--87},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199605)22:1\<83::AID-JGT11\>3.0.CO;2-P},
doi = {10.1002/(SICI)1097-0118(199605)22:1\<83::AID-JGT11\>3.0.CO;2-P},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Ainouche96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/AlonMM96,
author = {Noga Alon and
Colin McDiarmid and
Michael Molloy},
title = {Edge-disjoint cycles in regular directed graphs},
journal = {J. Graph Theory},
volume = {22},
number = {3},
pages = {231--237},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199607)22:3\<231::AID-JGT3\>3.0.CO;2-N},
doi = {10.1002/(SICI)1097-0118(199607)22:3\<231::AID-JGT3\>3.0.CO;2-N},
timestamp = {Thu, 24 Mar 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/AlonMM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/AoCMM96,
author = {S. Ao and
Ernest J. Cockayne and
Gary MacGillivray and
Christina M. Mynhardt},
title = {Domination critical graphs with higher independent domination numbers},
journal = {J. Graph Theory},
volume = {22},
number = {1},
pages = {9--14},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199605)22:1\<9::AID-JGT2\>3.0.CO;2-S},
doi = {10.1002/(SICI)1097-0118(199605)22:1\<9::AID-JGT2\>3.0.CO;2-S},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AoCMM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/AsratianHS96,
author = {Armen S. Asratian and
Roland H{\"{a}}ggkvist and
G. V. Sarkisian},
title = {A characterization of panconnected graphs satisfying a local ore-type
condition},
journal = {J. Graph Theory},
volume = {22},
number = {2},
pages = {95--103},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199606)22:2\<95::AID-JGT1\>3.0.CO;2-F},
doi = {10.1002/(SICI)1097-0118(199606)22:2\<95::AID-JGT1\>3.0.CO;2-F},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/AsratianHS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BalbuenaCF96,
author = {M. C. Balbuena and
{\'{A}}ngeles Carmona and
Miguel Angel Fiol},
title = {Distance connectivity in graphs and digraphs},
journal = {J. Graph Theory},
volume = {22},
number = {4},
pages = {281--292},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199608)22:4\<281::AID-JGT1\>3.0.CO;2-H},
doi = {10.1002/(SICI)1097-0118(199608)22:4\<281::AID-JGT1\>3.0.CO;2-H},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BalbuenaCF96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BandeltBL96,
author = {Hans{-}J{\"{u}}rgen Bandelt and
Gustav Burosch and
Jean{-}Marie Laborde},
title = {Cartesian products of trees and paths},
journal = {J. Graph Theory},
volume = {22},
number = {4},
pages = {347--356},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199608)22:4\<347::AID-JGT8\>3.0.CO;2-L},
doi = {10.1002/(SICI)1097-0118(199608)22:4\<347::AID-JGT8\>3.0.CO;2-L},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BandeltBL96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Bang-JensenGL96,
author = {J{\o}rgen Bang{-}Jensen and
Gregory Z. Gutin and
Hao Li},
title = {Sufficient conditions for a digraph to be Hamiltonian},
journal = {J. Graph Theory},
volume = {22},
number = {2},
pages = {181--187},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199606)22:2\<181::AID-JGT9\>3.0.CO;2-J},
doi = {10.1002/(SICI)1097-0118(199606)22:2\<181::AID-JGT9\>3.0.CO;2-J},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Bang-JensenGL96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Bogdanowicz96,
author = {Zbigniew R. Bogdanowicz},
title = {Pancyclicity of connected circulant graphs},
journal = {J. Graph Theory},
volume = {22},
number = {2},
pages = {167--174},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199606)22:2\<167::AID-JGT7\>3.0.CO;2-L},
doi = {10.1002/(SICI)1097-0118(199606)22:2\<167::AID-JGT7\>3.0.CO;2-L},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Bogdanowicz96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BroersmaHJV96,
author = {Haitze J. Broersma and
Jan van den Heuvel and
Bill Jackson and
Henk Jan Veldman},
title = {Hamiltonicity of regular 2-connected graphs},
journal = {J. Graph Theory},
volume = {22},
number = {2},
pages = {105--124},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199606)22:2\<105::AID-JGT2\>3.0.CO;2-R},
doi = {10.1002/(SICI)1097-0118(199606)22:2\<105::AID-JGT2\>3.0.CO;2-R},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BroersmaHJV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/BrunetRS96,
author = {Richard Brunet and
R. Bruce Richter and
Jozef Sir{\'{a}}n},
title = {Covering genus-reducing edges by Kuratowski subgraphs},
journal = {J. Graph Theory},
volume = {22},
number = {1},
pages = {39--45},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199605)22:1\<39::AID-JGT6\>3.0.CO;2-M},
doi = {10.1002/(SICI)1097-0118(199605)22:1\<39::AID-JGT6\>3.0.CO;2-M},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/BrunetRS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Catlin96,
author = {Paul A. Catlin},
title = {A reduction criterion for supereulerian graphs},
journal = {J. Graph Theory},
volume = {22},
number = {2},
pages = {151--153},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199606)22:2\<151::AID-JGT5\>3.0.CO;2-M},
doi = {10.1002/(SICI)1097-0118(199606)22:2\<151::AID-JGT5\>3.0.CO;2-M},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Catlin96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/CodatoCS96,
author = {Paolo Codato and
Michele Conforti and
Claudia Serafini},
title = {Packing \emph{T}-joins},
journal = {J. Graph Theory},
volume = {22},
number = {4},
pages = {293--296},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199608)22:4\<293::AID-JGT2\>3.0.CO;2-G},
doi = {10.1002/(SICI)1097-0118(199608)22:4\<293::AID-JGT2\>3.0.CO;2-G},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/CodatoCS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/DankelmannOS96,
author = {Peter Dankelmann and
Ortrud R. Oellermann and
Henda C. Swart},
title = {The average Steiner distance of a graph},
journal = {J. Graph Theory},
volume = {22},
number = {1},
pages = {15--22},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199605)22:1\<15::AID-JGT3\>3.0.CO;2-O},
doi = {10.1002/(SICI)1097-0118(199605)22:1\<15::AID-JGT3\>3.0.CO;2-O},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/DankelmannOS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Dong96,
author = {Jinquan Dong},
title = {Some results on graphs without long induced paths},
journal = {J. Graph Theory},
volume = {22},
number = {1},
pages = {23--28},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199605)22:1\<23::AID-JGT4\>3.0.CO;2-N},
doi = {10.1002/(SICI)1097-0118(199605)22:1\<23::AID-JGT4\>3.0.CO;2-N},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Dong96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/GeorgesM96,
author = {John P. Georges and
David W. Mauro},
title = {On the size of graphs labeled with a condition at distance two},
journal = {J. Graph Theory},
volume = {22},
number = {1},
pages = {47--57},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199605)22:1\<47::AID-JGT7\>3.0.CO;2-L},
doi = {10.1002/(SICI)1097-0118(199605)22:1\<47::AID-JGT7\>3.0.CO;2-L},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/GeorgesM96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Guo96,
author = {Yubao Guo},
title = {Strongly Hamiltonian-connected locally semicomplete digraphs},
journal = {J. Graph Theory},
volume = {22},
number = {1},
pages = {65--73},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199605)22:1\<65::AID-JGT9\>3.0.CO;2-J},
doi = {10.1002/(SICI)1097-0118(199605)22:1\<65::AID-JGT9\>3.0.CO;2-J},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Guo96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KilakosS96,
author = {Kyriakos Kilakos and
F. Bruce Shepherd},
title = {Subdivisions and the chromatic index of \emph{r}-graphs},
journal = {J. Graph Theory},
volume = {22},
number = {3},
pages = {203--212},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199607)22:3\<203::AID-JGT1\>3.0.CO;2-Q},
doi = {10.1002/(SICI)1097-0118(199607)22:3\<203::AID-JGT1\>3.0.CO;2-Q},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KilakosS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KlescRS96,
author = {Mari{\'{a}}n Klesc and
R. Bruce Richter and
Ian Stobert},
title = {The crossing number of \emph{C}\({}_{\mbox{5}}\) {\texttimes} \emph{C\({}_{\mbox{n}}\)}},
journal = {J. Graph Theory},
volume = {22},
number = {3},
pages = {239--243},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199607)22:3\<239::AID-JGT4\>3.0.CO;2-N},
doi = {10.1002/(SICI)1097-0118(199607)22:3\<239::AID-JGT4\>3.0.CO;2-N},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KlescRS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KohayakawaLR96,
author = {Yoshiharu Kohayakawa and
Tomasz Luczak and
Vojtech R{\"{o}}dl},
title = {Ramsey-type results for oriented trees},
journal = {J. Graph Theory},
volume = {22},
number = {1},
pages = {1--8},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199605)22:1\<1::AID-JGT1\>3.0.CO;2-S},
doi = {10.1002/(SICI)1097-0118(199605)22:1\<1::AID-JGT1\>3.0.CO;2-S},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KohayakawaLR96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Lu96,
author = {Xiaoyun Lu},
title = {On avoidable and unavoidable trees},
journal = {J. Graph Theory},
volume = {22},
number = {4},
pages = {335--346},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199608)22:4\<335::AID-JGT7\>3.0.CO;2-M},
doi = {10.1002/(SICI)1097-0118(199608)22:4\<335::AID-JGT7\>3.0.CO;2-M},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Lu96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/MacGillivrayS96,
author = {Gary MacGillivray and
Karen Seyffarth},
title = {Domination numbers of planar graphs},
journal = {J. Graph Theory},
volume = {22},
number = {3},
pages = {213--229},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199607)22:3\<213::AID-JGT2\>3.0.CO;2-P},
doi = {10.1002/(SICI)1097-0118(199607)22:3\<213::AID-JGT2\>3.0.CO;2-P},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/MacGillivrayS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/McKayP96,
author = {Brendan D. McKay and
Cheryl E. Praeger},
title = {Vertex-transitive graphs that are not Cayley graphs. {II}},
journal = {J. Graph Theory},
volume = {22},
number = {4},
pages = {321--334},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199608)22:4\<321::AID-JGT6\>3.0.CO;2-N},
doi = {10.1002/(SICI)1097-0118(199608)22:4\<321::AID-JGT6\>3.0.CO;2-N},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/McKayP96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/NedelaS96,
author = {Roman Nedela and
Martin Skoviera},
title = {Decompositions and reductions of snarks},
journal = {J. Graph Theory},
volume = {22},
number = {3},
pages = {253--279},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199607)22:3\<253::AID-JGT6\>3.0.CO;2-L},
doi = {10.1002/(SICI)1097-0118(199607)22:3\<253::AID-JGT6\>3.0.CO;2-L},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/NedelaS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Niemeyer96,
author = {Peter Niemeyer},
title = {On bounded automorphisms of locally finite transitive graphs},
journal = {J. Graph Theory},
volume = {22},
number = {4},
pages = {357--365},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199608)22:4\<357::AID-JGT9\>3.0.CO;2-K},
doi = {10.1002/(SICI)1097-0118(199608)22:4\<357::AID-JGT9\>3.0.CO;2-K},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Niemeyer96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Nishimura96,
author = {Tsuyoshi Nishimura},
title = {Component factors and induced subgraphs},
journal = {J. Graph Theory},
volume = {22},
number = {4},
pages = {305--308},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199604)22:4\<305::AID-JGT4\>3.0.CO;2-T},
doi = {10.1002/(SICI)1097-0118(199604)22:4\<305::AID-JGT4\>3.0.CO;2-T},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Nishimura96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/OtaT96,
author = {Katsuhiro Ota and
Taro Tokuda},
title = {A degree condition for the existence of regular factors in \emph{K}\({}_{\mbox{1,
\emph{n}}}\)-free graphs},
journal = {J. Graph Theory},
volume = {22},
number = {1},
pages = {59--64},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199605)22:1\<59::AID-JGT8\>3.0.CO;2-K},
doi = {10.1002/(SICI)1097-0118(199605)22:1\<59::AID-JGT8\>3.0.CO;2-K},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/OtaT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/PazPU96,
author = {Azaria Paz and
Judea Pearl and
Shmuel Ur},
title = {A new characterization of graphs based on interception relations},
journal = {J. Graph Theory},
volume = {22},
number = {2},
pages = {125--136},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199606)22:2\<125::AID-JGT3\>3.0.CO;2-P},
doi = {10.1002/(SICI)1097-0118(199606)22:2\<125::AID-JGT3\>3.0.CO;2-P},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/PazPU96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Polat96,
author = {Norbert Polat},
title = {Colorings of infinite graphs without one-colored rays},
journal = {J. Graph Theory},
volume = {22},
number = {2},
pages = {189--201},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199606)22:2\<189::AID-JGT10\>3.0.CO;2-E},
doi = {10.1002/(SICI)1097-0118(199606)22:2\<189::AID-JGT10\>3.0.CO;2-E},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Polat96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/RamachandranP96,
author = {S. Ramachandran and
R. Parvathy},
title = {Pancyclicity and extendability in strong products},
journal = {J. Graph Theory},
volume = {22},
number = {1},
pages = {75--82},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199605)22:1\<75::AID-JGT10\>3.0.CO;2-N},
doi = {10.1002/(SICI)1097-0118(199605)22:1\<75::AID-JGT10\>3.0.CO;2-N},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/RamachandranP96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/SandersZ96,
author = {Daniel P. Sanders and
Yue Zhao},
title = {On \emph{d}-diagonal colorings},
journal = {J. Graph Theory},
volume = {22},
number = {2},
pages = {155--166},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199606)22:2\<155::AID-JGT6\>3.0.CO;2-M},
doi = {10.1002/(SICI)1097-0118(199606)22:2\<155::AID-JGT6\>3.0.CO;2-M},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/SandersZ96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/SanyalS96,
author = {Barun K. Sanyal and
Malay K. Sen},
title = {New characterizations of digraphs represented by intervals},
journal = {J. Graph Theory},
volume = {22},
number = {4},
pages = {297--303},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199608)22:4\<297::AID-JGT3\>3.0.CO;2-G},
doi = {10.1002/(SICI)1097-0118(199608)22:4\<297::AID-JGT3\>3.0.CO;2-G},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/SanyalS96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Steffen96,
author = {Eckhard Steffen},
title = {Tutte's 5-flow conjecture for graphs of nonorientable genus 5},
journal = {J. Graph Theory},
volume = {22},
number = {4},
pages = {309--319},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199608)22:4\<309::AID-JGT5\>3.0.CO;2-P},
doi = {10.1002/(SICI)1097-0118(199608)22:4\<309::AID-JGT5\>3.0.CO;2-P},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Steffen96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Triesch96,
author = {Eberhard Triesch},
title = {Degree sequences of graphs and dominance order},
journal = {J. Graph Theory},
volume = {22},
number = {1},
pages = {89--93},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199605)22:1\<89::AID-JGT12\>3.0.CO;2-J},
doi = {10.1002/(SICI)1097-0118(199605)22:1\<89::AID-JGT12\>3.0.CO;2-J},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Triesch96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/TuzaV96,
author = {Zsolt Tuza and
Margit Voigt},
title = {Every 2-choosable graph is (2\emph{m, m})-choosable},
journal = {J. Graph Theory},
volume = {22},
number = {3},
pages = {245--252},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199607)22:3\<245::AID-JGT5\>3.0.CO;2-M},
doi = {10.1002/(SICI)1097-0118(199607)22:3\<245::AID-JGT5\>3.0.CO;2-M},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/TuzaV96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Vu96,
author = {Van H. Vu},
title = {On the embedding of graphs into graphs with few eigenvalues},
journal = {J. Graph Theory},
volume = {22},
number = {2},
pages = {137--149},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199606)22:2\<137::AID-JGT4\>3.0.CO;2-O},
doi = {10.1002/(SICI)1097-0118(199606)22:2\<137::AID-JGT4\>3.0.CO;2-O},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Vu96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/Wakelin96,
author = {C. D. Wakelin},
title = {Chromatic polynomials and {\(\sigma\)}-polynomials},
journal = {J. Graph Theory},
volume = {22},
number = {4},
pages = {367--381},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199608)22:4\<367::AID-JGT10\>3.0.CO;2-C},
doi = {10.1002/(SICI)1097-0118(199608)22:4\<367::AID-JGT10\>3.0.CO;2-C},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/Wakelin96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/WangL96,
author = {Weifan Wang and
Jiazhuang Liu},
title = {On the vertex face total chromatic number of planar graphs},
journal = {J. Graph Theory},
volume = {22},
number = {1},
pages = {29--37},
year = {1996},
url = {https://doi.org/10.1002/(SICI)1097-0118(199605)22:1\<29::AID-JGT5\>3.0.CO;2-N},
doi = {10.1002/(SICI)1097-0118(199605)22:1\<29::AID-JGT5\>3.0.CO;2-N},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/WangL96.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.
retrieved on 2024-05-30 01:10 CEST 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:
