default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 120
Volume 120, Number 1-3, August 2002
- Claudio Arbib
, Michele Flammini:
On the upper chromatic number of (v3, b2)-configurations. 3-12 - Douglas Bauer, Hajo Broersma, Aurora Morgana, Edward F. Schmeichel:
Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion. 13-23 - Stephan Brandt:
Triangle-free graphs and forbidden subgraphs. 25-33 - Hajo Broersma, Liming Xiong:
A note on minimum degree conditions for supereulerian graphs. 35-43 - Hajo Broersma, Xueliang Li:
Some approaches to a conjecture on short cycles in digraphs. 45-53 - Gerard J. Chang, Sheng-Chyang Liaw, Hong-Gwa Yeh:
k-Subdomination in graphs. 55-60 - Janka Chlebíková:
The structure of obstructions to treewidth and pathwidth. 61-71 - Giuseppe Confessore, Paolo Dell'Olmo, Stefano Giordani:
An approximation result for the interval coloring problem on claw-free chordal graphs. 73-90 - Celina M. H. de Figueiredo, John G. Gimbel, Célia Picinin de Mello, Jayme Luiz Szwarcfiter:
A note on transitive orientations with maximum sets of sources and sinks. 91-95 - Miranca Fischermann, Lutz Volkmann:
Graphs having distance-n domination number half their order. 97-107 - Yubao Guo, Jin Ho Kwak:
The cycle structure of regular multipartite tournaments. 109-116 - Thomas Harmuth:
An inductive definition of cubic toroidal maps. 117-140 - Sandi Klavzar, Uros Milutinovic, Ciril Petr:
On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem. 141-157 - Masataka Nakamura:
A single-element extension of antimatroids. 159-164 - Stavros D. Nikolopoulos:
Coloring permutation graphs in parallel. 165-195 - Patric R. J. Östergård:
A fast algorithm for the maximum clique problem. 197-207 - Artem V. Pyatkin:
The incidentor coloring of multigraphs and its applications. 209-217 - Bert Randerath, Ingo Schiermeyer, Meike Tewes, Lutz Volkmann:
Vertex pancyclic graphs. 219-237 - Meike Tewes:
Pancyclic orderings of in-tournaments. 239-249 - Hein van der Holst, José Coelho de Pina:
Length-bounded disjoint paths in planar graphs. 251-261 - Hansjoachim Walther:
Polyhedral graphs with extreme numbers of types of faces. 263-274 - Blaz Zmazek, Janez Zerovnik:
Algorithm for recognizing Cartesian graph bundles. 275-302
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-02-15 00:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
