Properly Coloured Cycles and Paths: Results and Open Problems (English)
- New search for: Gutin, G.
- New search for: Kim, E.J.
- New search for: Gutin, G.
- New search for: Kim, E.J.
- New search for: Golumbic, Martin Charles
- New search for: Lipshteyn, Marina
- New search for: Levit, V. E.
In:
Graph theory, Computational intelligence and thought
5420
;
200-208
;
2009
-
ISBN:
-
ISSN:
- Conference paper / Print
-
Title:Properly Coloured Cycles and Paths: Results and Open Problems
-
Contributors:Gutin, G. ( author ) / Kim, E.J. ( author ) / Golumbic, Martin Charles / Lipshteyn, Marina / Levit, V. E.
-
Conference:Conference, Graph theory, Computational intelligence and thought ; 2008 ; Jerusalem, Israel
-
Published in:Graph theory, Computational intelligence and thought , 5420 ; 200-208LECTURE NOTES IN COMPUTER SCIENCE , 5420 ; 200-208
-
Publisher:
- New search for: Springer-Verlag
-
Place of publication:Berlin
-
Publication date:2009-01-01
-
Size:9 pages
-
Remarks:Includes bibliographical references and index.
-
ISBN:
-
ISSN:
-
Type of media:Conference paper
-
Type of material:Print
-
Language:English
-
Keywords:
-
Source:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Table of contents conference proceedings
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
Landmarks in Algorithmic Graph Theory: A Personal RetrospectiveGolumbic, M.C. et al. | 2009
- 15
-
A Higher-Order Graph Calculus for Autonomic ComputingAndrei, O. / Kirchner, H. et al. | 2009
- 27
-
Algorithms on Subtree Filament GraphsGavril, F. et al. | 2009
- 36
-
A Note on the Recognition of Nested GraphsKorenblit, M. / Levit, V.E. et al. | 2009
- 41
-
Asynchronous Congestion GamesPenn, M. / Polukarov, M. / Tennenholtz, M. et al. | 2009
- 54
-
Combinatorial Problems for Horn ClausesLanglois, M. / Mubayi, D. / Sloan, R.H. / Turan, G. et al. | 2009
- 66
-
Covering a Tree by a ForestGavril, F. / Itai, A. et al. | 2009
- 77
-
Dominating Induced MatchingsCardoso, D.M. / Lozin, V.V. et al. | 2009
- 87
-
HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity ResultsGottlob, G. / Greco, G. / Marnette, B. et al. | 2009
- 100
-
Local Search Heuristics for the Multidimensional Assignment ProblemGutin, G. / Karapetyan, D. et al. | 2009
- 116
-
On Distance-3 Matchings and Induced MatchingsBrandstadt, A. / Mosca, R. et al. | 2009
- 127
-
On Duality between Local Maximum Stable Sets of a Graph and Its Line-GraphLevit, V.E. / Mandrescu, E. et al. | 2009
- 134
-
On Path Partitions and Colourings in DigraphsHartman, I.B.-A. et al. | 2009
- 144
-
On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6Levit, V.E. / Tankus, D. et al. | 2009
- 148
-
On the Cubicity of AT-Free Graphs and Circular-Arc GraphsChandran, L.S. / Francis, M.C. / Sivadasan, N. et al. | 2009
- 158
-
O(m log n) Split Decomposition of Strongly Connected GraphsJoeris, B.L. / Lundberg, S. / McConnell, R.M. et al. | 2009
- 172
-
Path-Bicolorable Graphs (Extended Abstract)Brandstadt, A. / Golumbic, M.C. / Le, V.B. / Lipshteyn, M. et al. | 2009
- 183
-
Path Partitions, Cycle Covers and Integer Decomposition (Lecture Note)Sebo, A. et al. | 2009
- 200
-
Properly Coloured Cycles and Paths: Results and Open ProblemsGutin, G. / Kim, E.J. et al. | 2009
- 209
-
Recognition of Antimatroidal Point SetsKempner, Y. / Levit, V.E. et al. | 2009
- 217
-
Tree Projections: Game Characterization and Computational AspectsGottlob, G. / Greco, G. / Miklos, Z. / Scarcello, F. / Schwentick, T. et al. | 2009