Ear decompositions of join covered graphs

Autor:	Luciano L. Silveira, Marcelo Henriques de Carvalho
Rok vydání:	2011
Předmět:	Discrete mathematics Applied Mathematics Trapezoid graph 1-planar graph Modular decomposition Combinatorics Indifference graph Pathwidth Chordal graph Discrete Mathematics and Combinatorics Maximal independent set Cograph MathematicsofComputing_DISCRETEMATHEMATICS Mathematics
Zdroj:	Electronic Notes in Discrete Mathematics. 37:171-176
ISSN:	1571-0653
DOI:	10.1016/j.endm.2011.05.030
Popis:	Join covered graphs are ±1-weighted graphs, without negative circuits, in which every edge lies in a zero-weight circuit. Join covered graphs are a natural generalization of matching covered graphs. Many important properties of matching covered graphs have been generalized to join covered graphs. In this paper, we generalize Lovasz and Plummerʼs ear decomposition theorem of matching covered graphs to join covered graphs.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::1f6174b147204dee324190ee5a53d4db https://doi.org/10.1016/j.endm.2011.05.030 Zobrazit plný text záznamu Full Text from ScienceDirect