Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Journal=J. Graph Theory AND Volume=73
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A note on hitting maximum and maximal cliques with a stable set
Demetres Christofides
,
Katherine Edwards
,
Andrew D. King
Journal of Graph Theory
73
(3), 2013, pp. 354-360
Circular-arc bigraphs and its subclasses
Asim Basu
,
Sandip Das
,
Shamik Ghosh
,
Malay Sen
Journal of Graph Theory
73
(4), 2013, pp. 361-376
An upper bound for the excessive index of an
r
-graph
Giuseppe Mazzuoccolo
Journal of Graph Theory
73
(4), 2013, pp. 377-385
Acyclic chromatic indices of planar graphs with girth at least 4
Qiaojun Shu
,
Weifan Wang
,
Yiqiao Wang
Journal of Graph Theory
73
(4), 2013, pp. 386-399
Hereditary efficiently dominatable graphs
Martin Milanic̀‘
Journal of Graph Theory
73
(4), 2013, pp. 400-424
Identifying codes in line graphs
Florent Foucaud
,
Sylvain Gravier
,
Reza Naserasr
,
Aline Parreau
,
Petru Valicov
Journal of Graph Theory
73
(4), 2013, pp. 425-448
Extremal graphs with a given number of perfect matchings
Stephen G. Hartke
,
Derrick Stolee
,
Douglas B. West
,
Matthew Yancey
Journal of Graph Theory
73
(4), 2013, pp. 449-468
A sufficient condition for edge chromatic critical graphs to be Hamiltonian - An approach to Vizing's 2-factor conjecture
Rong Luo
,
Yue Zhao
Journal of Graph Theory
73
(4), 2013, pp. 469-482
Seiten
<
1
2