Regular spanning subgraphs of bipartite graphs of high minimum degree.
The Electronic Journal of Combinatorics [electronic only] (2007)
- Volume: 14, Issue: 1, page Research Paper N21, 7 p.-Research Paper N21, 7 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topCsaba, Béla. "Regular spanning subgraphs of bipartite graphs of high minimum degree.." The Electronic Journal of Combinatorics [electronic only] 14.1 (2007): Research Paper N21, 7 p.-Research Paper N21, 7 p.. <http://eudml.org/doc/129674>.
@article{Csaba2007,
author = {Csaba, Béla},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {spanning subgraph; factors of graphs; bipartite graph; bipartition; spanning regular subgraph},
language = {eng},
number = {1},
pages = {Research Paper N21, 7 p.-Research Paper N21, 7 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Regular spanning subgraphs of bipartite graphs of high minimum degree.},
url = {http://eudml.org/doc/129674},
volume = {14},
year = {2007},
}
TY - JOUR
AU - Csaba, Béla
TI - Regular spanning subgraphs of bipartite graphs of high minimum degree.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2007
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 14
IS - 1
SP - Research Paper N21, 7 p.
EP - Research Paper N21, 7 p.
LA - eng
KW - spanning subgraph; factors of graphs; bipartite graph; bipartition; spanning regular subgraph
UR - http://eudml.org/doc/129674
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.