Graph Theory


TitleAuthor(s)Imp.¹Rec.²sort iconTopic » SubtopicPosted by
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
Seymour's r-graph conjectureSeymour✭✭✭0Coloring » Edge coloringmdevos
Goldberg's conjectureGoldberg✭✭✭0Coloring » Edge coloringmdevos
Double-critical graph conjectureErdos; Lovasz✭✭0Coloring » Vertex coloringDFR
Shannon capacity of the seven-cycle✭✭✭0tchow
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
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
Number of Cliques in Minor-Closed ClassesWood✭✭0David Wood
Shuffle-Exchange Conjecture (graph-theoretic form)Beneš; Folklore; Stone✭✭✭0Vadim Lioubimov
Are different notions of the crossing number the same?Pach; Tóth✭✭✭0Topological G.T. » Crossing numberscibulka
Friendly partitionsDeVos✭✭0Basic G.T.mdevos
Separators in string graphsFox; Pach; Tóth✭✭0cibulka
Odd cycles and low oddness✭✭0Gagik
Beneš Conjecture (graph-theoretic form)Beneš✭✭✭0Vadim Lioubimov
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
Syndicate content