Registro:

Referencias:

• Berge, C., Färbung von Graphen, deren sämtliche beziehungsweise, deren ungerade Kreise starr sind (Zusammenfassung) (1961) Wissenschaftliche Zeitschrift der Martin-Luther-Universität Halle-Wittenberg, Mathematisch-Naturwissenschaftliche Reihe, 10, pp. 114-115
• Berge, C., Two theorems in graph theory (1957) Proceedings of the National Academy of Sciences, 43, pp. 842-844
• Björner, A., Ziegler, G.M., Introduction to greedoids (1992) Matroid Applications, 40, pp. 284-357. , N. White, Encyclopedia of Mathematics and its Applications Cambridge Univ. Press Cambridge
• Bourjolly, J.M., Pulleyblank, W.R., König-Egerváry graphs, 2-bicritical graphs and fractional matchings (1989) Discrete Applied Mathematics, 24, pp. 63-82
• Chudnovsky, M., Robertson, N., Seymour, P.D., Thomas, R., The strong perfect graph theorem (2006) Annals of Mathematics, 164, pp. 51-229
• Deming, R.W., Independence numbers of graphs - An extension of the Koenig-Egervary theorem (1979) Discrete Mathematics, 27, pp. 23-33
• Dobson, M.P., Leoni, V.A., Nasini, G.L., Recognizing edge-perfect graphs: Some polynomial instances (2009) Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, pp. 153-156. , Paris, France
• Dobson, M.P., Leoni, V.A., Nasini, G.L., A characterization of edge-perfect graphs and the complexity of recognizing some combinatorial optimization games (2013) Discrete Optimization, 10, pp. 54-60
• Egerváry, J., Matrixok kombinatorikus tulajdonságairól (1931) Matematikai És Fizikai Lapok, 38, pp. 16-28
• Escalante, M.S., Leoni, V.A., Nasini, G.L., A graph theoretical model for the total balancedness of combinatorial optimization games (2012) Revista de la Unión Matemática Argentina, 53, pp. 85-92
• Gallai, T., Über extreme Punkt- und Kantenmengen (1959) Annales Universitatis Scientarium Budapestinensis de Rolando Eötvös Nominatae Sectio Mathematica, 2, pp. 133-138
• Konig, D., Graphok és matrixok (1931) Matematikai És Fizikai Lapok, 38, pp. 116-119
• Korach, E., (1982) Flowers and Trees in A Ballet of K 4, or A Finite Basis Characterization of Non-Konig-Egerváry Graphs, , Technical Report 115, IBM-Israel Scientific Center
• Korach, E., Nguyen, T., Peis, B., Subgraph characterization of red/blue-split graph and Konig-Egerváry graphs (2006) Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 842-850. , Miami, Florida, USA
• Korte, B., Lovász, L., Mathematical structures underlying greedy algorithms (1981) Fundamentals of Computation Theory, 117, pp. 205-209. , Lectures Notes in Computer Science
• Korte, B., Lovász, L., Schrader, R., (1991) Greedoids, 4. , Algorithms and Combinatorics Springer-Verlag Berlin
• Larson, C.E., The critical independence number and an independence decomposition (2011) European Journal of Combinatorics, 32, pp. 294-300
• Levit, V.E., Mandrescu, E., Well-covered and König-Egerváry graphs (1998) Congressus Numerantium, 130, pp. 209-218
• Levit, V.E., Mandrescu, E., On maximum matchings in König-Egerváry graphs (2013) Discrete Applied Mathematics, 161, pp. 1635-1638
• Levit, V.E., Mandrescu, E., Critical independent sets and König-Egerváry graphs (2012) Graphs and Combinatorics, 28, pp. 243-250
• Levit, V.E., Mandrescu, E., Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids (2007) Discrete Applied Mathematics, 155, pp. 2414-2425
• Levit, V.E., Mandrescu, E., On local maximum stable set greedoids (2012) Discrete Mathematics, 312, pp. 588-596
• Lovász, L., Ear-decompositions of matching-covered graphs (1983) Combinatorica, 3, pp. 105-117
• Lovász, L., Plummer, M.D., (1986) Matching Theory, , North-Holland
• Mark Kayll, P., König-Egerváry graphs are non-Edmonds (2010) Graphs and Combinatorics, 26, pp. 721-726
• Peis, B., (2006) Structure Analysis of Some Generalizations of Matchings and Matroids under Algorithmic Aspects, , Ph.D. Thesis, Zentrum für Angewandte Informatik, Universität zu Köln, Germany
• Sterboul, F., A characterization of the graphs in which the transversal number equals the matching number (1979) Journal of Combinatorial Theory, Series B, 27, pp. 228-229

Citas:

---------- APA ----------

---------- CHICAGO ----------

---------- MLA ----------

---------- VANCOUVER ----------