Graph Theory

TitleAuthor(s)Imp.¹sort iconRec.²Topic » SubtopicPosted by
List colorings of edge-critical graphsMohar✭✭0Coloring » Edge coloringRobert Samal
Circular coloring triangle-free subcubic planar graphsGhebleh; Zhu✭✭0Coloring » Vertex coloringmdevos
Laplacian Degrees of a GraphGuo✭✭0Algebraic G.T.Robert Samal
5-local-tensionsDeVos✭✭0Topological G.T. » Coloringmdevos
Weak pentagon problemSamal✭✭0Coloring » HomomorphismsRobert Samal
Infinite uniquely hamiltonian graphsMohar✭✭0Infinite GraphsRobert Samal
Hamiltonian cycles in line graphs of infinite graphsGeorgakopoulos✭✭0Infinite GraphsRobert Samal
Hamiltonian cycles in powers of infinite graphsGeorgakopoulos✭✭0Infinite GraphsRobert Samal
Oriented chromatic number of planar graphs✭✭0Coloring » Vertex coloringRobert Samal
Geodesic cycles and Tutte's TheoremGeorgakopoulos; Sprüssel✭✭1Basic G.T. » CyclesAgelos
The intersection of two perfect matchingsMacajova; Skoviera✭✭0Basic G.T. » Matchingsmdevos
¿Are critical k-forests tight?Strausz✭✭0HypergraphsDino
Three-chromatic (0,2)-graphsPayan✭✭0ColoringGordon Royle
What is the smallest number of disjoint spanning trees made a graph HamiltonianGoldengorin✭✭0Extremal G.T.boris
Linear Hypergraphs with Dimension 3Ossona de Mendez; Rosenstiehl; de Fraysseix✭✭0Topological G.T. » Drawingstaxipom
Matchings extend to Hamiltonian cycles in hypercubesRuskey; Savage✭✭1Basic G.T. » MatchingsJirka
The Bermond-Thomassen ConjectureBermond; Thomassen✭✭0Directed GraphsJS
Universal Steiner triple systemsGrannell; Griggs; Knor; Skoviera✭✭0Coloring » Edge coloringmacajova
Jones' conjectureKloks; Lee; Liu✭✭0Basic G.T. » Cyclescmlee
Highly arc transitive two ended digraphsCameron; Praeger; Wormald✭✭0Infinite Graphsmdevos
Random stable roommatesMertens✭✭0Basic G.T. » Matchingsmdevos
Complete bipartite subgraphs of perfect graphsFox✭✭0Basic G.T.mdevos
Coloring random subgraphsBukh✭✭0Probabilistic G.T.mdevos
4-regular 4-chromatic graphs of high girthGrunbaum✭✭0Coloringmdevos
Negative association in uniform forestsPemantle✭✭0Probabilistic G.T.mdevos
Counting 3-colorings of the hex latticeThomassen✭✭0Coloring » Vertex coloringmdevos
Crossing sequencesArchdeacon; Bonnington; Siran✭✭0Topological G.T. » Crossing numbersRobert Samal
Circular colouring the orthogonality graphDeVos; Ghebleh; Goddyn; Mohar; Naserasr✭✭0Coloring » Vertex coloringmdevos
Frankl's union-closed sets conjectureFrankl✭✭0Hypergraphstchow
Double-critical graph conjectureErdos; Lovasz✭✭0Coloring » Vertex coloringDFR
Book Thickness of SubdivisionsBlankenship; Oporowski✭✭1David Wood
3-Colourability of Arrangements of Great CirclesFelsner; Hurtado; Noy; Streinu✭✭1Topological G.T. » ColoringDavid Wood
Does the chromatic symmetric function distinguish between trees?Stanley✭✭0Algebraic G.T.mdevos
Bounding the chromatic number of triangle-free graphs with fixed maximum degreeKostochka; Reed✭✭0Coloring » Vertex coloringAndrew King
Domination in plane triangulationsMatheson; Tarjan✭✭0Topological G.T.mdevos
Asymptotic Distribution of Form of Polyhedra Rüdinger✭✭0Basic G.T.andreasruedinger
Are vertex minor closed classes chi-bounded?Geelen✭✭0Coloring » Vertex coloringmdevos
Domination in cubic graphsReed✭✭0Basic G.T.mdevos
A gold-grabbing gameRosenfeld✭✭0Graph Algorithmsmdevos
Number of Cliques in Minor-Closed ClassesWood✭✭0David Wood
Friendly partitionsDeVos✭✭0Basic G.T.mdevos
Separators in string graphsFox; Pach; Tóth✭✭0cibulka
Odd cycles and low oddness✭✭0Gagik
Approximation Ratio for Maximum Edge Disjoint Paths problemBentz✭✭0jcmeyer
Approximation ratio for k-outerplanar graphsBentz✭✭0jcmeyer
Finding k-edge-outerplanar graph embeddingsBentz✭✭0jcmeyer
Exact colorings of graphsErickson✭✭0Martin Erickson
Algorithm for graph homomorphismsFomin; Heggernes; Kratsch✭✭0Coloring » Homomorphismsjfoniok
Star chromatic index of cubic graphsDvorak; Mohar; Samal✭✭0Robert Samal
Star chromatic index of complete graphsDvorak; Mohar; Samal✭✭1Robert Samal
Syndicate content