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

Group connectivity of graphs satisfying the Chvátal-condition

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

DOI10.1016/J.DAM.2023.08.008zbMATH Open1526.05080MaRDI QIDQ6069166FDOQ6069166


Authors: Na Yang, Jian-Hua Yin Edit this on Wikidata


Publication date: 13 November 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)





Recommendations

  • The Chvátal-Erdős condition for group connectivity in graphs
  • Chvátal-Erdös type theorems
  • Degree conditions for group connectivity
  • The Chvátal-Erdös condition for cycles in triangle-free graphs


zbMATH Keywords

group connectivitybalanced bipartite graphChvátal-condition


Mathematics Subject Classification ID

Vertex degrees (05C07) Flows in graphs (05C21) Connectivity (05C40)


Cites Work

  • Graph theory with applications
  • Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
  • Group connectivity of 3-edge-connected chordal graphs
  • Group connectivity of certain graphs
  • Ore-condition and \(Z_3\)-connectivity
  • Degree sum condition for \(Z_{3}\)-connectivity in graphs
  • A strong Pósa condition for a graphic list to be forcibly \(Z_3\)-connected


Cited In (1)

  • Degree conditions for group connectivity





This page was built for publication: Group connectivity of graphs satisfying the Chvátal-condition

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

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