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

The multiplicity of 1-factors in the square of a graph

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

DOI10.1002/JGT.3190080308zbMATH Open0545.05050OpenAlexW2067216532MaRDI QIDQ3335822FDOQ3335822


Authors: George R. T. Hendry Edit this on Wikidata


Publication date: 1984

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190080308




Recommendations

  • The multiplicity of 1-factors in total graphs
  • Star subdivisions and connected even factors in the square of a graph
  • Edge-disjoint 1-factors in powers of connected graphs
  • Publication:3487420
  • Counting 1-factors in infinite graphs


zbMATH Keywords

1-factorsquare of a graph


Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)



Cited In (6)

  • Title not available (Why is that?)
  • Extending cycles in graphs
  • Extending cycles in bipartite graphs
  • Title not available (Why is that?)
  • Edge-disjoint 1-factors in powers of connected graphs
  • The multiplicity of 1-factors in total graphs





This page was built for publication: The multiplicity of 1-factors in the square of a graph

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

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