Unmixed bipartite graphs

Veröffentlicht

2007-07-01

Unmixed bipartite graphs

Grafos bipartitos sin mezcla

Schlagworte:

Unmixed graph, Minimal vertex cover, Bipartite graph, König theorem, 2000 Mathematics Subject Classification. 05C75, 05C90, 13H10 (en)
Grafos no-mezclados, Cubrimiento de vértices mínimo, Grafos bipartitos, Teorema de König (es)

Downloads

PDF (English)

Autor/innen

Centro de Investigación y de Estudios Avanzados del IPN, Ciudad de México, México

Abstract (en)
Abstract (es)

Abstract. In this note we give a combinatorial characterization of all the unmixed bipartite graphs.

En esta nota nosotros presentamos una caracterización combinatoria de todos los grafos bipartitos no-mezcladas.

Literaturhinweise

Berge, C. Some common properties for regularizable graphs, edge-critical graphs and b-graphs. In Theory and practice of combinatorics, G.S. J.T.A. Rosa, Ed., vol. 60. North-Holland Math. Stud., Amsterdam, 1982, pp. 31-44.

Estrada, M., and Villarreal, R. H. Cohen-Macaulay bipartite graphs. Arch. Math. 68 (1997), 124-128.

Harary, F. Graph Theory. Addison-Wesley, 1972. Reading, MA.

Herzog, J., and Hibi, T. Distributive lattices, bipartite graphs and Alexander duality. J. Algebraic Combin. 22, 3 (2005), 289-302.

Morey, S., Reyes, E., and Villarreal, R. H. Cohen-Macaulay, shellable and unmixed clutters with a perfect matching of König ty p e. J. Pure Appl. Algebra. To appear.

Plummer, M. D. Some covering concepts in graphs. J. Combinatorial Theory 8 (1970), 91-98.

Ravindra, G. Well-covered graphs. J. Combinatorics Information Syst. Sci. 2, 1 (1977), 20-21.

Villarreal, R. H. Cohen-Macaulay graphs. Manuscripta Math. 66 (1990), 277-293.

Zitationsvorschlag

APA

Rafael H. (2007). Unmixed bipartite graphs. Revista Colombiana de Matemáticas, 41(2), 393–395. https://revistas.unal.edu.co/index.php/recolma/article/view/94930

ACM

[1]

Rafael H. 2007. Unmixed bipartite graphs. Revista Colombiana de Matemáticas. 41, 2 (Juli 2007), 393–395.

ACS

(1)

Rafael H. Unmixed bipartite graphs. rev.colomb.mat 2007, 41, 393-395.

ABNT

RAFAEL H. Unmixed bipartite graphs. Revista Colombiana de Matemáticas, [S. l.], v. 41, n. 2, p. 393–395, 2007. Disponível em: https://revistas.unal.edu.co/index.php/recolma/article/view/94930. Acesso em: 22 jan. 2025.

Chicago

Rafael H. 2007. „Unmixed bipartite graphs“. Revista Colombiana De Matemáticas 41 (2):393-95. https://revistas.unal.edu.co/index.php/recolma/article/view/94930.

Harvard

Rafael H. (2007) „Unmixed bipartite graphs“, Revista Colombiana de Matemáticas, 41(2), S. 393–395. Verfügbar unter: https://revistas.unal.edu.co/index.php/recolma/article/view/94930 (Zugegriffen: 22 Januar 2025).

IEEE

[1]

Rafael H., „Unmixed bipartite graphs“, rev.colomb.mat, Bd. 41, Nr. 2, S. 393–395, Juli 2007.

MLA

Rafael H. „Unmixed bipartite graphs“. Revista Colombiana de Matemáticas, Bd. 41, Nr. 2, Juli 2007, S. 393-5, https://revistas.unal.edu.co/index.php/recolma/article/view/94930.

Turabian

Rafael H. „Unmixed bipartite graphs“. Revista Colombiana de Matemáticas 41, no. 2 (Juli 1, 2007): 393–395. Zugegriffen Januar 22, 2025. https://revistas.unal.edu.co/index.php/recolma/article/view/94930.

Vancouver

1.

Rafael H. Unmixed bipartite graphs. rev.colomb.mat [Internet]. 1. Juli 2007 [zitiert 22. Januar 2025];41(2):393-5. Verfügbar unter: https://revistas.unal.edu.co/index.php/recolma/article/view/94930