On the number of components of a graph

MaRDI QIDQ3558652zbMATHFDO

Authors Hamza Si Kaddour, Elias Tahhan-Bittar

Publication date 5 May 2010

zbMATH Keywords

graphinduced subgraphBoolean algebracyclelengthordered setvertex-coloringcyclomatic numberindependentinterval algebraspairwise independent subsetspseudo tree algebras

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Connectivity (05C40) Structure theory of Boolean algebras (06E05)

Recommendations

• Cyclomatic numbers of connected induced subgraphs
• Forest decompositions of graphs with cyclomatic number 3
• scientific article; zbMATH DE number 4142076
• On enumeration of spanning subgraphs with a preassigned cyclomatic number in a graph
• Note on independent sets of a graph

Cited in

(3)

• On the Number of Components of a Graph Related to Character Degrees
• On seed graphs with more than two components
• On the number of edges of a graph and its complement

This page was built for publication: On the number of components of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3558652)