Graph Theory


TitleAuthor(s)Imp.¹Rec.²sort iconTopic » SubtopicPosted by
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
Mapping planar graphs to odd cyclesJaeger✭✭✭0Coloring » Homomorphismsmdevos
Weak pentagon problemSamal✭✭0Coloring » HomomorphismsRobert Samal
Graceful Tree Conjecture✭✭✭0Coloring » Labelingkintali
r-regular graphs are not uniquely hamiltonian.Sheehan✭✭✭0Basic G.T. » CyclesRobert Samal
Infinite uniquely hamiltonian graphsMohar✭✭0Infinite GraphsRobert Samal
Hamiltonian cycles in line graphsThomassen✭✭✭0Basic G.T. » CyclesRobert 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
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
Pebbling a cartesian productGraham✭✭✭0mdevos
Linear Hypergraphs with Dimension 3Ossona de Mendez; Rosenstiehl; de Fraysseix✭✭0Topological G.T. » Drawingstaxipom
The Bermond-Thomassen ConjectureBermond; Thomassen✭✭0Directed GraphsJS
Coloring the Odd Distance GraphRosenfeld✭✭✭0Coloring » Vertex coloringmdevos
Universal Steiner triple systemsGrannell; Griggs; Knor; Skoviera✭✭0Coloring » Edge coloringmacajova
Jones' conjectureKloks; Lee; Liu✭✭0Basic G.T. » Cyclescmlee
Reconstruction conjectureKelly; Ulam✭✭✭✭0zitterbewegung
Universal highly arc transitive digraphsCameron; Praeger; Wormald✭✭✭0Infinite Graphsmdevos
Unfriendly partitionsCowan; Emerson✭✭✭0Infinite Graphsmdevos
Strong matchings and coversAharoni✭✭✭0Infinite Graphsmdevos
Highly arc transitive two ended digraphsCameron; Praeger; Wormald✭✭0Infinite Graphsmdevos
Chords of longest cyclesThomassen✭✭✭0Basic G.T. » Cyclesmdevos
Seagull problemSeymour✭✭✭0Basic G.T. » Minorsmdevos
Random stable roommatesMertens✭✭0Basic G.T. » Matchingsmdevos
Partial List ColoringAlbertson; Grossman; Haas✭✭✭0Coloring » Vertex coloringIradmusa
Partial List ColoringIradmusa✭✭✭0Coloring » Vertex coloringIradmusa
Degenerate colorings of planar graphsBorodin✭✭✭0Topological G.T. » Coloringmdevos
Nearly spanning regular subgraphsAlon; Mubayi✭✭✭0Basic G.T.mdevos
Edge Reconstruction ConjectureHarary✭✭✭0melch
Hedetniemi's ConjectureHedetniemi✭✭✭0Coloring » Vertex coloringmdevos
Total Colouring ConjectureBehzad✭✭✭0ColoringIradmusa
Cores of strongly regular graphsCameron; Kazanidis✭✭✭0Algebraic G.T.mdevos
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
Characterizing (aleph_0,aleph_1)-graphsDiestel; Leader✭✭✭0Infinite Graphsmdevos
Negative association in uniform forestsPemantle✭✭0Probabilistic G.T.mdevos
Counting 3-colorings of the hex latticeThomassen✭✭0Coloring » Vertex coloringmdevos
Non-edges vs. feedback edge sets in digraphsChudnovsky; Seymour; Sullivan✭✭✭0Directed Graphsmdevos
Monochromatic reachability or rainbow trianglesSands; Sauer; Woodrow✭✭✭0Directed Graphs » Tournamentsmdevos
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
Edge list coloring conjecture✭✭✭0Coloring » Edge coloringtchow
Syndicate content