Graph factorization: Difference between revisions

Revision as of 20:02, 15 August 2020

Revision as of 06:39, 1 February 2021

Line 94:

|last1 = Bondy

|first1 = John Adrian

|authorlink1author-link1 = John Adrian Bondy

|last2 = Murty

|first2 = U. S. R.

|authorlink2author-link2 = U. S. R. Murty

|title = Graph Theory with Applications

|year = 1976

Line 129:

}}, Chapter 2: "Matching, covering and packing". [http://www.math.uni-hamburg.de/home/diestel/books/graph.theory/ Electronic edition].

*{{citation

| last=Harary | first=Frank | authorlinkauthor-link=Frank Harary

| title=Graph Theory

| publisher=Addison-Wesley

Line 157:

}}.

*{{citation

| last=Petersen | first=Julius | authorlinkauthor-link=Julius Petersen

| title=Die Theorie der regulären graphs

| journal=[[Acta Mathematica]]

Line 170:

| title=1-Factorization Conjecture (1985?)

| work=Open Problems – Graph Theory and Combinatorics

| accessdateaccess-date=2010-01-09

| ref=West1FC

}}

Line 181:

{{refbegin}}

*{{citation

| last=Plummer | first=Michael D. | authorlinkauthor-link = Michael D. Plummer

| title=Graph factors and factorization: 1985–2003: A survey

| journal=[[Discrete Mathematics (journal)|Discrete Mathematics]]