Unique-maximum edge-colouring of plane graphs with respect to faces

References

Page 1

	Year	Citations
Every planar map is four colorable K. I. Appel, Wolfgang Haken Bulletin of the American Mathematical Society	1976	1.1K
The Four-Colour Theorem Neil Robertson, Daniel P. Sanders, Paul Seymour, Journal of Combinatorial Theory Series B Theoretical MathematicsDiscrete MathematicsGeometry Of Number	1997	601
Ordered colourings Meir Katchalski, William McCuaig, Suzanne M. Seager Discrete Mathematics	1995	84
Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs Panagiotis Cheilaris, Balázs Keszegh, Dömötör Pálvölgyi SIAM Journal on Discrete Mathematics Mathematical ProgrammingCf Chromatic NumbersEngineeringGraph TheoryAlgebraic Graph Theory	2013	37
Graph unique-maximum and conflict-free colorings Panagiotis Cheilaris, Gézá Tóth Journal of Discrete Algorithms Mathematical ProgrammingEngineeringGraph TheoryConflict-free ColoringsExtremal Graph Theory	2011	27
Maximum face-constrained coloring of plane graphs Radhika Ramamurthi, Douglas B. West Discrete Mathematics Geometric ModelingMathematical ProgrammingGeometric Graph TheoryEngineeringGraph Theory	2003	25
Facial non-repetitive edge-coloring of plane graphs Frédéric Havet, Stanislav Jendrol′, Roman Soták, Journal of Graph Theory	2010	22
Colouring vertices of plane graphs under restrictions given by faces Július Czap, Stanislav Jendrol′ Discussiones Mathematicae Graph Theory Geometric Graph TheoryGraph TheoryAlgebraic Graph TheoryFace αTopological Graph Theory	2009	19
Covering the edges of a graph by three odd subgraphs Tamás Mátrai Journal of Graph Theory Odd SubgraphsGeometric Graph TheoryGraph TheoryAlgebraic Graph TheoryStructural Graph Theory	2006	18
Facial parity edge colouring of plane pseudographs Július Czap, Stanislav Jendrol′, František Kardoš, Discrete Mathematics Geometric ModelingFacial Recognition SystemImage AnalysisGraph TheoryPlane Pseudographs	2012	16

Page 1