Acyclically 3-colorable planar graphs

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of combinatorial optimization
1. Verfasser: Angelini, Patrizio (VerfasserIn)
Weitere Verfasser: Frati, Fabrizio (VerfasserIn)
Format: UnknownFormat
Sprache:eng
Veröffentlicht: 2012
Schlagworte:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs 2013
Edge-colouring of joins of regular graphs II 2013 De Simone, Caterina
Two-stage proportionate flexible flow shop to minimize the makespan 2013 Choi, Byung-cheon
Chromatic number of distance graphs generated by the sets {2, 3, x, y} 2013 Liu, Daphne Der-Fen
Semi-online scheduling on two identical machines with rejection 2013
Relay node placement in two-tiered wireless sensor networks with base stations 2013 Chen, Guangting
A bilevel programming problem with maximization of a supermodular function in the lower level 2013 Fanghänel, Diana
Minimum degree, edge-connectivity and radius 2013
(1+ε)-competitive algorithm for online OVSF code assignment with resource augmentation 2013 Asahiro, Yuichi
On the outer-connected domination in graphs 2013
Maximum latency scheduling problem on two-person cooperative games 2013
The maximum flow problem with disjunctive constraints 2013 Pferschy, Ulrich
Practical unicast and convergecast scheduling schemes for cognitive radio networks 2013
Adjacent vertex-distinguishing edge coloring of graphs with maximum degree Δ 2013 Hocquard, Hervé
Online algorithms for maximizing weighted throughput of unit jobs with temperature constraints 2013
On some geometric problems of color-spanning sets 2013
Optimal job insertion in the no-wait job shop 2013 Bürgy, Reinhard
Flipping triangles and rectangles 2013 Jiang, Minghui
A new three-machine shop scheduling : complexity and approximation algorithm 2013
An extension of Stein-Lovász theorem and some of its applications 2013 Lee, Guang-siang
Alle Artikel auflisten