Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

f-factors and related decompositions of graphs

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

DOI10.1016/0095-8956(80)90056-8zbMath0451.05035OpenAlexW1975102601MaRDI QIDQ1147717

W. B. Jurkat, Jack E. Graver

Publication date: 1980

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(80)90056-8

zbMATH Keywords

factors of a graph


Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)


Related Items

Packing $k$-Matchings and $k$-Critical Graphs



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Spanning subgraphs with specified valencies
  • 1-Faktoren von Graphen. (1-factors of graphs)
  • Maximal Flow Through a Network
  • Paths, Trees, and Flowers
  • Subgraphs with prescribed valencies
  • On the structure of factorizable graphs
  • On the structure of factorizable graphs. II
  • The Factorization of Linear Graphs
  • The Factors of Graphs
  • A Short Proof of the Factor Theorem for Finite Graphs
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1147717&oldid=13208067"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 05:19.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki