Directed Hamilton Cycles in Digraphs and Matching Alternating Hamilton Cycles in Bipartite Graphs (Englisch)
- Neue Suche nach: Zhang, Z.-B.
- Neue Suche nach: Zhang, X.
- Neue Suche nach: Wen, X.
- Neue Suche nach: Zhang, Z.-B.
- Neue Suche nach: Zhang, X.
- Neue Suche nach: Wen, X.
In:
SIAM JOURNAL ON DISCRETE MATHEMATICS
;
27
, 1
;
274-289
;
2013
-
ISSN:
- Aufsatz (Zeitschrift) / Print
-
Titel:Directed Hamilton Cycles in Digraphs and Matching Alternating Hamilton Cycles in Bipartite Graphs
-
Beteiligte:
-
Erschienen in:SIAM JOURNAL ON DISCRETE MATHEMATICS ; 27, 1 ; 274-289
-
Verlag:
- Neue Suche nach: SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS
-
Erscheinungsdatum:01.01.2013
-
Format / Umfang:16 pages
-
ISSN:
-
Medientyp:Aufsatz (Zeitschrift)
-
Format:Print
-
Sprache:Englisch
- Neue Suche nach: 510
- Weitere Informationen zu Dewey Decimal Classification
-
Klassifikation:
DDC: 510 -
Datenquelle:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Inhaltsverzeichnis – Band 27, Ausgabe 1
Zeige alle Jahrgänge und Ausgaben
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
Flooding in Weighted Sparse Random GraphsAmini, Hamed et al. | 2013
- 27
-
On the Number of Hamilton Cycles in Sparse Random GraphsGlebov, Roman et al. | 2013
- 43
-
Near-Popular Matchings in the Roommates ProblemHuang, Chien-Chung et al. | 2013
- 63
-
Mixed and Circular Multichromosomal Genomic Median ProblemBoyd, Sylvia et al. | 2013
- 75
-
Efficient Algorithms for Eulerian Extension and Rural PostmanDorn, Frederic et al. | 2013
- 95
-
A Local Strengthening of Reed's $\omega$, $\Delta$, $\chi$ Conjecture for Quasi-line GraphsChudnovsky, Maria et al. | 2013
- 109
-
Stable Routing and Unique-Max Coloring on TreesHähnle, Nicolai et al. | 2013
- 126
-
First-Fit Coloring of Incomparability GraphsBosek, Bartlomiej et al. | 2013
- 141
-
${4,5}$ Is Not Coverable: A Counterexample to a Conjecture of Kaiser and ŠkrekovskiČada, Roman et al. | 2013
- 141
-
{4, 5} Is Not Coverable: A Counterexample to a Conjecture of Kaiser and SkrekovskiCada, R. / Chiba, S. / Ozeki, K. / Vrana, P. / Yoshimoto, K. et al. | 2013
- 145
-
Repeated Degrees in Random Uniform HypergraphsBalister, Paul et al. | 2013
- 155
-
Rooted-Tree Decompositions with Matroid Constraints and the Infinitesimal Rigidity of Frameworks with BoundariesKatoh, Naoki et al. | 2013
- 186
-
A Submodular Optimization Approach to Bicriteria Scheduling Problems with Controllable Processing Times on Parallel MachinesShioura, Akiyoshi et al. | 2013
- 205
-
Integer Representations of Convex Polygon Intersection GraphsMüller, Tobias et al. | 2013
- 232
-
Maximum Size of Reverse-Free Sets of PermutationsCibulka, Josef et al. | 2013
- 240
-
Cover-Decomposition and Polychromatic NumbersBollobás, Béla et al. | 2013
- 257
-
A Lower Bound for the Complexity of Monotone Graph PropertiesScheidweiler, Robert et al. | 2013
- 266
-
Nonseparable, Concave Utilities Are Easy---in a Perfect Price Discrimination Market ModelVazirani, Vijay V. et al. | 2013
- 274
-
Directed Hamilton Cycles in Digraphs and Matching Alternating Hamilton Cycles in Bipartite GraphsZhang, Zan-Bo et al. | 2013
- 290
-
Subset Feedback Vertex Set Is Fixed-Parameter TractableCygan, Marek et al. | 2013
- 310
-
Target Set Selection Problem for Honeycomb NetworksChiang, Chun-Ying et al. | 2013
- 329
-
Relationships between Pairs of Representations of Signed Binary MatroidsGuenin, Bertrand et al. | 2013
- 342
-
An Improved Upper Bound on the Length of the Longest Cycle of a Supercritical Random GraphKemkes, Graeme et al. | 2013
- 363
-
Adversarial Leakage in GamesAlon, Noga et al. | 2013
- 386
-
Distributions of Sparse Spanning Subgraphs in Random GraphsGao, Pu et al. | 2013
- 402
-
The Complexity of Deletion Problems for MatroidsSnook, Michael et al. | 2013
- 422
-
Spanning Trees with Bounded Maximum Degrees of Graphs on SurfacesOzeki, Kenta et al. | 2013
- 436
-
Nonrepetitive Choice Number of TreesKozik, Jakub et al. | 2013
- 447
-
On the Singularity of Random Combinatorial MatricesNguyen, Hoi H. et al. | 2013
- 459
-
A Tropical Intersection Product in Matroidal FansShaw, Kristin M. et al. | 2013
- 492
-
Nullity and Loop Complementation for Delta-MatroidsBrijder, Robert et al. | 2013
- 507
-
Hypergraphic LP Relaxations for Steiner TreesChakrabarty, Deeparnab et al. | 2013
- 534
-
Coloring Claw-Free Graphs with $\Delta-1$ ColorsCranston, Daniel W. et al. | 2013
- 550
-
The Number of Edges in $k$-Quasi-planar GraphsFox, Jacob et al. | 2013
- 562
-
Minimizing the Number of Carries in AdditionAlon, Noga et al. | 2013
- 567
-
Matroid-Based Packing of Arborescencesde Gevigney, Olivier Durand et al. | 2013
- 575
-
A Bound for the Maximum Weight of a Linear CodeBall, Simeon et al. | 2013
- 584
-
A Relaxation of Steinberg's ConjectureHill, Owen et al. | 2013