default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 100
Volume 100, Number 1, May 2022
- Charles Camacho
, Silvia Fernández-Merchant, Marija Jelic Milutinovic, Rachel Kirsch, Linda Kleist, Elizabeth Bailey Matson, Jennifer White:
Bounding the tripartite-circle crossing number of complete tripartite graphs. 5-27 - Robert Lukotka, Edita Rollová:
Perfect matchings in highly cyclically connected regular graphs. 28-49 - Alewyn P. Burger, Johan P. de Wet, Marietjie Frick, Nico Van Cleemput, Carol T. Zamfirescu:
Planar hypohamiltonian oriented graphs. 50-68 - Vladimir Gurvich, Matjaz Krnc, Martin Milanic, Mikhail N. Vyalyi:
Shifting paths to avoidable ones. 69-83 - Zdenek Dvorák, Bernard Lidický:
Coloring count cones of planar graphs. 84-100 - Xizhi Liu, Dhruv Mubayi:
On a generalized Erdős-Rademacher problem. 101-126 - Carl Bürger, Jan Kurkofka:
Duality theorems for stars and combs III: Undominated combs. 127-139 - Carl Bürger, Jan Kurkofka:
Duality theorems for stars and combs IV: Undominating stars. 140-162 - György Kiss, Stefko Miklavic, Tamás Szonyi:
A stability result for girth-regular graphs with even girth. 163-181 - Yan Cao, Guantao Chen, Guangming Jing:
A note on Goldberg's conjecture on total chromatic numbers. 182-188 - Jakub Przybylo:
Asymptotic confirmation of the Faudree-Lehel conjecture on irregularity strength for all but extreme degrees. 189-204
Volume 100, Number 2, June 2022
- Premysl Holub, Zdenek Ryjácek, Petr Vrána, Shipeng Wang, Liming Xiong:
Forbidden pairs of disconnected graphs for 2-factor of connected graphs. 209-231 - Leandro Montero, Sylvain Legay:
On the edge-biclique graph and the iterated edge-biclique operator. 232-251 - Sagi Snir, Osnat Weissberg, Raphael Yuster:
On the quartet distance given partial information. 252-269 - Zdenek Dvorák:
On weighted sublinear separators. 270-280 - Henning Bruhn:
Even A-cycles have the edge-Erdős-Pósa property. 281-293 - Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo:
Arc-disjoint in- and out-branchings in digraphs of independence number at most 2. 294-314 - Georg Grasegger, Hakan Guler, Bill Jackson, Anthony Nixon:
Flexible circuits in the d-dimensional rigidity matroid. 315-330 - Sylwia Cichacz, Zsolt Tuza:
Realization of digraphs in Abelian groups and its consequences. 331-345 - Anna Gujgiczer, Gábor Simonyi:
On multichromatic numbers of widely colorable graphs. 346-361 - Peter Bradshaw:
Graph colorings with restricted bicolored subgraphs: I. Acyclic, star, and treewidth colorings. 362-370 - Peter Bradshaw:
Graph colorings with restricted bicolored subgraphs: II. The graph coloring game. 371-383
Volume 100, Number 3, July 2022
- Yuansheng Yang, Guoqing Wang, Haoli Wang, Yan Zhou:
Disproof of a conjecture by Erdős and Guy on the crossing number of hypercubes. 389-434 - Wouter Cames van Batenburg, Rémi de Joannis de Verclos, Ross J. Kang, François Pirot:
Strong chromatic index and Hadwiger number. 435-457 - Suil O:
Eigenvalues and [ a , b ] -factors in regular graphs. 458-469 - Vojtech Dvorák, Peter van Hintum, Amy Shaw, Marius Tiba:
Radius, girth and minimum degree. 470-488 - Xiaofeng Gu, Hong-Jian Lai, Sulin Song:
On hamiltonian line graphs of hypergraphs. 489-503 - Arash Rafiey:
Recognizing interval bigraphs by forbidden patterns. 504-529 - John Haslegrave:
The number and average size of connected sets in graphs with degree constraints. 530-542 - Sam Spiro, Jacques Verstraëte:
Counting hypergraphs with large girth. 543-558 - Michael Molloy, Luke Postle:
Asymptotically good edge correspondence colourings. 559-577 - József Balogh, Alexandr V. Kostochka, Mikhail Lavrov, Xujun Liu:
Monochromatic connected matchings in 2-edge-colored multipartite graphs. 578-607
Volume 100, Number 4, August 2022
- Youngsik Huh, Jung Hoon Lee:
Linearly free graphs. 613-629 - Andrej Brodnik, Aleksander Malnic, Rok Pozar:
A subquadratic algorithm for the simultaneous conjugacy problem. 630-637 - Pierre Aboulker, Laurent Beaudou, Martín Matamala, José Zamora:
Graphs with no induced house nor induced hole have the de Bruijn-Erdös property. 638-652 - Jessica McDonald, Gregory J. Puleo:
Strong coloring 2-regular graphs: Cycle restrictions and partial colorings. 653-670 - Mark N. Ellingham, Linyuan Lu, Zhiyu Wang:
Maximum spectral radius of outerplanar 3-uniform hypergraphs. 671-685 - Borut Luzar, Edita Mácajová, Martin Skoviera, Roman Soták:
Strong edge colorings of graphs and the covers of Kneser graphs. 686-697 - Jørgen Bang-Jensen, Matthias Kriesell:
Good acyclic orientations of 4-regular 4-connected graphs. 698-720 - Louis DeBiasio, András Gyárfás:
Covering 2-colored complete digraphs by monochromatic d $d$ -dominating digraphs. 721-726 - Guantao Chen, Yanli Hao:
Multithreshold multipartite graphs. 727-732 - Zilong Yan, Yuejian Peng:
Tree embeddings and tree-star Ramsey numbers. 733-745
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.
last updated on 2024-11-19 20:46 CET 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:
