Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

On the number of components of a graph

From MaRDI portal
Publication:3558652
Jump to:navigation, search

zbMATH Open1190.05077MaRDI QIDQ3558652FDOQ3558652


Authors: Hamza Si Kaddour, Elias Tahhan-Bittar Edit this on Wikidata


Publication date: 5 May 2010





Recommendations

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


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)



Cited In (3)

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





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)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3558652&oldid=16946930"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 5 February 2024, at 01:38. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki