CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
research
Decomposing dense bipartite graphs into 4-cycles
Authors
Nicholas J. Cavenagh
Publication date
25 February 2015
Publisher
'The Electronic Journal of Combinatorics'
Abstract
Let G be an even bipartite graph with partite sets X and Y such that |Y | is even and the minimum degree of a vertex in Y is at least 95|X|/96. Suppose furthermore that the number of edges in G is divisible by 4. Then G decomposes into 4-cycles
Similar works
Full text
Open in the Core reader
Download PDF
Available Versions
Research Commons@Waikato
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:researchcommons.waikato.ac...
Last time updated on 05/06/2015
CiteSeerX
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:CiteSeerX.psu:10.1.1.680.6...
Last time updated on 29/10/2017
Name not available
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:researchcommons.waikato.ac...
Last time updated on 16/11/2016