Graph Theory

TitleAuthor(s)Imp.¹Rec.²Topic » SubtopicPosted bysort icon
Unions of triangle free graphsErdos; Hajnal✭✭✭0Infinite Graphsmdevos
Ramsey properties of Cayley graphsAlon✭✭✭0Algebraic G.T.mdevos
Circular coloring triangle-free subcubic planar graphsGhebleh; Zhu✭✭0Coloring » Vertex coloringmdevos
5-local-tensionsDeVos✭✭0Topological G.T. » Coloringmdevos
Mapping planar graphs to odd cyclesJaeger✭✭✭0Coloring » Homomorphismsmdevos
The intersection of two perfect matchingsMacajova; Skoviera✭✭0Basic G.T. » Matchingsmdevos
Coloring and immersionAbu-Khzam; Langston✭✭✭1Coloring » Vertex coloringmdevos
Pebbling a cartesian productGraham✭✭✭0mdevos
Coloring the Odd Distance GraphRosenfeld✭✭✭0Coloring » Vertex coloringmdevos
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
Degenerate colorings of planar graphsBorodin✭✭✭0Topological G.T. » Coloringmdevos
Nearly spanning regular subgraphsAlon; Mubayi✭✭✭0Basic G.T.mdevos
Hedetniemi's ConjectureHedetniemi✭✭✭0Coloring » Vertex coloringmdevos
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
Circular colouring the orthogonality graphDeVos; Ghebleh; Goddyn; Mohar; Naserasr✭✭0Coloring » Vertex coloringmdevos
Seymour's r-graph conjectureSeymour✭✭✭0Coloring » Edge coloringmdevos
Goldberg's conjectureGoldberg✭✭✭0Coloring » Edge coloringmdevos
Does the chromatic symmetric function distinguish between trees?Stanley✭✭0Algebraic G.T.mdevos
Domination in plane triangulationsMatheson; Tarjan✭✭0Topological G.T.mdevos
Graphs with a forbidden induced tree are chi-boundedGyarfas✭✭✭0Coloring » Vertex coloringmdevos
Are vertex minor closed classes chi-bounded?Geelen✭✭0Coloring » Vertex coloringmdevos
Domination in cubic graphsReed✭✭0Basic G.T.mdevos
Crossing numbers and coloringAlbertson✭✭✭0Topological G.T. » Crossing numbersmdevos
A gold-grabbing gameRosenfeld✭✭0Graph Algorithmsmdevos
Friendly partitionsDeVos✭✭0Basic G.T.mdevos
Signing a graph to have small magnitude eigenvaluesBilu; Linial✭✭0mdevos
Are almost all graphs determined by their spectrum?✭✭✭0mdevos
Edge Reconstruction ConjectureHarary✭✭✭0melch
Almost all non-Hamiltonian 3-regular graphs are 1-connectedHaythorpe✭✭1Basic G.T.mhaythorpe
Half-integral flow polynomial valuesMohar✭✭0Algebraic G.T.mohar
Seymour's Second Neighbourhood ConjectureSeymour✭✭✭1Directed Graphsnkorppi
Cores of Cayley graphsSamal✭✭✭✭✭0Coloring » HomomorphismsRobert Samal
Pentagon problemNesetril✭✭✭0Coloring » HomomorphismsRobert Samal
The Crossing Number of the Complete Graph✭✭✭0Topological G.T. » Crossing numbersRobert Samal
The Crossing Number of the Complete Bipartite GraphTuran✭✭✭0Topological G.T. » Crossing numbersRobert Samal
The Crossing Number of the HypercubeErdos; Guy✭✭0Topological G.T. » Crossing numbersRobert Samal
Syndicate content